Minimum fill-in and treewidth for graphs modularly decomposable into chordal graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1517, Issue , 1998, Pages 315-358

  Dahlhaus, Elias ^a,b  

^a UNIVERSITY OF COLOGNE   (Germany)

^b UNIVERSITY OF BONN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY;

CHORDAL GRAPHS; LINEAR TIME; TREE-WIDTH; WEAK BIPOLARIZABLE;

GRAPHIC METHODS;

EID: 84947910622     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10692760_28     Document Type: Conference Paper

References (15)

1. Arnborg, S., D. G. Corneil and A. Proskurowski, Complexity of finding embeddings in a k-tree, SIAM J. Alg. Disc. Meth. 8, (1987), pp. 277-284.
2. L. Babel, Triangulating Graphs with Few P4s, submitted.
3. H.J. Broersma, E. Dahlhaus, T. Kloks, A Linear Time Algorithm for Minimum Fill-in and Treewidth for Distance Hereditary Graphs, submitted.
4. H.J. Broersma, E. Dahlhaus, T. Kloks, Algorithms for the Treewidth and Minimum Fill-in of HHD-Free Graphs, WG 97, LNCS 1335, pp. 109-117.
5. P. Bunemann, A Characterization of Rigid Circuit Graphs, Discrete Mathematics 9 (1974), pp. 205-212.
6. A. Cournier and M. Habib, A new linear algorithm for modular decomposition,in CAAP '94: 19th International Colloquium, Lecture Notes in Computer Science, Sophie Tison, ed., 1994, pp. 68-82.
7. Elias Dahlhaus, Jens Gustedt, Ross McConnell, Efficient and Practical Modular Decomposition, Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (1997), pp. 26-35.
8. M. Farber, Characterizations of Strongly Chordal Graphs, Discrete Mathematics 43 (1983), pp. 173-189.
9. A. Frank, Some Polynomial Time Algorithms for Certain Graphs and Hypergraphs, Proceedings of the 5th British Combinatorial Conference, Congressus Numeran-tium XV, Untilitas Mathematicae, Winnipeg (1976), pp. 211-226.
10. C.T. Hoang and N. Khouzam, On Brittle Graphs, Journal of Graph Theory 12 (1988), pp. 391-404.
11. R. M. McConnell and J. P. Spinrad, Linear-time modular decomposition and efficient transitive orientation of undirected graphs, in Proceedings of the fifth annual ACM-SIAM Symposium on Discrete Algorithms, D. D. Sleator et al., eds., Society of Industrial and Applied Mathematics (SIAM), 1994, pp. 536-545.
12. S. Olariu, Weak Bipolarizable Graphs, Discrete Mathematics 74 (1989), pp. 159-171.
13. D. Rose, Triangulated Graphs and the Elimination Process, Journal of Mathematical Analysis and Applications 32 (1970), pp. 597-609.
14. R. Tarjan, M. Yannakakis, Simple Linear Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hyper-graphs, SIAM Journal on Computing 13 (1984), pp. 566-579. Addendum: SIAM Journal on Computing 14 (1985), pp. 254-255.
15. M. Yannakakis, Computing the Minimum Fill-in is NP-complete, SIAM Journal on Algebraic and Discrete Methods 2 (1981), pp. 77-79.