|
991
|
Algorithmic Graph Theory And Perfect Graphs
– M C Golumbic
- 1980
|
|
76
|
A new linear algorithm for modular decomposition, LNCS 787
– A Cournier, M Habib
- 1994
|
|
64
|
Substitution decomposition for discrete structures and connections with combinatorial optimization
– R H Möhring, F J Radermacher
- 1984
|
|
140
|
L.K.: A linear recognition algorithm for cographs
– D G Corneil, Y Perl, Stewart
- 1985
|
|
29
|
Some classes of perfectly orderable graphs
– Chính T Hoàng, Bruce A Reed
- 1989
|
|
17
|
E#cient and practical modular decomposition
– E Dahlhaus, J Gustedt, R M McConnell
- 1997
|
|
261
|
Algorithmic aspects of vertex elimination on graphs
– D J Rose, R E Tarjan, G S Lueker
- 1976
|
|
69
|
Transitiv orientierbare Graphen
– T Gallai
- 1967
|
|
15
|
Efficient and Practical Modular Decomposition
– Elias Dahlhaus , Jens Gustedt, Ross M. McConnell
- 1997
|
|
104
|
Burlingham: Complement reducible graphs
– D G Corneil, H Lerchs, L Stewart
- 1981
|
|
23
|
Incremental modular decomposition
– J H Muller, J P Spinrad
- 1989
|
|
67
|
Split Graphs, in
– S Foldes, P L Hammer
- 1977
|
|
13
|
Theory of 2-structures, part 1: Clans, basic subclasses, and morphisms
– A Ehrenfeucht, G Rozenberg
- 1990
|
|
234
|
Graph classes: a survey
– A Brandstadt, V B Le, J P Spinrad
- 1999
|
|
56
|
Linear-time modular decomposition and efficient transitive orientation of comparability graphs
– R M McConnell, J Spinrad
- 1994
|
|
33
|
Substitution decomposition on chordal graphs and its applications
– W-L Hsu, T-H Ma
- 1991
|
|
406
|
G.: Testing for the consecutive ones property, interval graphs and graph planarity using PQ-trees
– K Booth, Lueker
- 1976
|
|
12
|
An O(n2) divide-and-conquer algorithm for the prime tree decomposition of two-structures and modular decomposition of graphs
– A Ehrenfeucht, H N Gabow, R M McConnell, S J Sullivan
- 1994
|
|
17
|
Graph Classes: A Survey
– A Brandst adt, V B Le, J Spinrad
- 1999
|
