AAAAAA

   
Results: 1-14 |
Results: 14
RANKINGS OF GRAPHS
Authors: BODLAENDER HL DEOGUN JS JANSEN K KLOKS T KRATSCH D MULLER H TUZA Z
Citation: Hl. Bodlaender et al., RANKINGS OF GRAPHS, SIAM journal on discrete mathematics, 11(1), 1998, pp. 168-181
MINIMUM FILL-IN ON CIRCLE AND CIRCULAR-ARC GRAPHS
Authors: KLOKS T KRATSCH D WONG CK
Citation: T. Kloks et al., MINIMUM FILL-IN ON CIRCLE AND CIRCULAR-ARC GRAPHS, Journal of algorithms (Print), 28(2), 1998, pp. 272-289
LISTING ALL MINIMAL SEPARATORS OF A GRAPH
Authors: KLOKS T KRATSCH D
Citation: T. Kloks et D. Kratsch, LISTING ALL MINIMAL SEPARATORS OF A GRAPH, SIAM journal on computing, 27(3), 1998, pp. 605-613
MEASURING THE VULNERABILITY FOR CLASSES OF INTERSECTION GRAPHS
Authors: KRATSCH D KLOKS T MULLER H
Citation: D. Kratsch et al., MEASURING THE VULNERABILITY FOR CLASSES OF INTERSECTION GRAPHS, Discrete applied mathematics, 77(3), 1997, pp. 259-270
ON TREEWIDTH AND MINIMUM FILL-IN OF ASTEROIDAL TRIPLE-FREE GRAPHS
Authors: KLOKS T KRATSCH D SPINRAD J
Citation: T. Kloks et al., ON TREEWIDTH AND MINIMUM FILL-IN OF ASTEROIDAL TRIPLE-FREE GRAPHS, Theoretical computer science, 175(2), 1997, pp. 309-335
TOTAL DOMINATION AND TRANSFORMATION
Authors: KRATSCH D STEWART L
Citation: D. Kratsch et L. Stewart, TOTAL DOMINATION AND TRANSFORMATION, Information processing letters, 63(3), 1997, pp. 167-170
AN APPROXIMATION ALGORITHM FOR CLUSTERING GRAPHS WITH DOMINATING DIAMETRAL PATH
Authors: DEOGUN JS KRATSCH D STEINER G
Citation: Js. Deogun et al., AN APPROXIMATION ALGORITHM FOR CLUSTERING GRAPHS WITH DOMINATING DIAMETRAL PATH, Information processing letters, 61(3), 1997, pp. 121-127
MINIMAL NON-NEIGHHORHOOD PERFECT GRAPHS
Authors: GYARFAS A KRATSCH D LEHEL J MAFFRAY F
Citation: A. Gyarfas et al., MINIMAL NON-NEIGHHORHOOD PERFECT GRAPHS, Journal of graph theory, 21(1), 1996, pp. 55-66
TREEWIDTH AND PATHWIDTH OF PERMUTATION GRAPHS
Authors: BODLAENDER HL KLOKS T KRATSCH D
Citation: Hl. Bodlaender et al., TREEWIDTH AND PATHWIDTH OF PERMUTATION GRAPHS, SIAM journal on discrete mathematics, 8(4), 1995, pp. 606-616
TREEWIDTH OF CHORDAL BIPARTITE GRAPHS
Authors: KLOKS T KRATSCH D
Citation: T. Kloks et D. Kratsch, TREEWIDTH OF CHORDAL BIPARTITE GRAPHS, Journal of algorithms, 19(2), 1995, pp. 266-281
COMPUTING A PERFECT EDGE WITHOUT VERTEX-ELIMINATION ORDERING OF A CHORDAL BIPARTITE GRAPH
Authors: KLOKS T KRATSCH D
Citation: T. Kloks et D. Kratsch, COMPUTING A PERFECT EDGE WITHOUT VERTEX-ELIMINATION ORDERING OF A CHORDAL BIPARTITE GRAPH, Information processing letters, 55(1), 1995, pp. 11-16
ON COCOLOURINGS AND COCHROMATIC NUMBERS OF GRAPHS
Authors: GIMBEL J KRATSCH D STEWART L
Citation: J. Gimbel et al., ON COCOLOURINGS AND COCHROMATIC NUMBERS OF GRAPHS, Discrete applied mathematics, 48(2), 1994, pp. 111-127
ON THE COMPLEXITY OF GRAPH RECONSTRUCTION
Authors: KRATSCH D HEMASPAANDRA LA
Citation: D. Kratsch et La. Hemaspaandra, ON THE COMPLEXITY OF GRAPH RECONSTRUCTION, Mathematical systems theory, 27(3), 1994, pp. 257-273
DOMINATION ON COCOMPARABILITY GRAPHS
Authors: KRATSCH D STEWART L
Citation: D. Kratsch et L. Stewart, DOMINATION ON COCOMPARABILITY GRAPHS, SIAM journal on discrete mathematics, 6(3), 1993, pp. 400-417
Risultati: 1-14 |