AAAAAA

   
Results: 1-7 |
Results: 7
MATCHING PROBLEMS IN SELECTIVE ASSEMBLY OPERATIONS
Authors: COULLARD CR GAMBLE AB JONES PC
Citation: Cr. Coullard et al., MATCHING PROBLEMS IN SELECTIVE ASSEMBLY OPERATIONS, Annals of operations research, 76, 1998, pp. 95-107
MINIMUM-WEIGHT CYCLES IN 3-SEPARABLE GRAPHS
Authors: COULLARD CR GARDNER LL WAGNER DK
Citation: Cr. Coullard et al., MINIMUM-WEIGHT CYCLES IN 3-SEPARABLE GRAPHS, Networks, 29(3), 1997, pp. 151-160
THE DOMINANT OF THE 2-CONNECTED-STEINER-SUBGRAPH POLYTOPE FOR W-4-FREE GRAPHS
Authors: COULLARD CR RAIS A RARDIN RL WAGNER DK
Citation: Cr. Coullard et al., THE DOMINANT OF THE 2-CONNECTED-STEINER-SUBGRAPH POLYTOPE FOR W-4-FREE GRAPHS, Discrete applied mathematics, 66(1), 1996, pp. 33-43
TOTALLY UNIMODULAR LEONTIEF DIRECTED HYPERGRAPHS
Authors: COULLARD CR NG PH
Citation: Cr. Coullard et Ph. Ng, TOTALLY UNIMODULAR LEONTIEF DIRECTED HYPERGRAPHS, Linear algebra and its applications, 230, 1995, pp. 101-125
UNCOVERING GENERALIZED-NETWORK STRUCTURE IN MATRICES
Authors: COULLARD CR DELGRECO JG WAGNER DK
Citation: Cr. Coullard et al., UNCOVERING GENERALIZED-NETWORK STRUCTURE IN MATRICES, Discrete applied mathematics, 46(3), 1993, pp. 191-220
RECOGNIZING A CLASS OF BICIRCULAR MATROIDS
Authors: COULLARD CR DELGRECO JG WAGNER DK
Citation: Cr. Coullard et al., RECOGNIZING A CLASS OF BICIRCULAR MATROIDS, Discrete applied mathematics, 43(3), 1993, pp. 197-215
LINEAR-TIME ALGORITHMS FOR THE 2-CONNECTED STEINER SUBGRAPH PROBLEM ON SPECIAL CLASSES OF GRAPHS
Authors: COULLARD CR RAIS A RARDIN RL WAGNER DK
Citation: Cr. Coullard et al., LINEAR-TIME ALGORITHMS FOR THE 2-CONNECTED STEINER SUBGRAPH PROBLEM ON SPECIAL CLASSES OF GRAPHS, Networks, 23(3), 1993, pp. 195-206
Risultati: 1-7 |