Minimal triangulations for graphs with "Few" minimal separators

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

Volumn 1461 LNCS, Issue , 1998, Pages 344-355

  Bouchitté, Vincent ^a   Todinca, Ioan ^a  

^a UNIV LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION; SEPARATORS; SET THEORY; TRIANGULATION;

MAXIMAL SETS; MINIMAL TRIANGULATIONS; POLYNOMIAL-TIME; TREE-WIDTH;

GRAPHIC METHODS;

EID: 84896693545     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-68530-8_29     Document Type: Conference Paper

References (14)

1. J. R. S. Blair and B. Peyton. An introduction to chordal graphs and clique trees. In A. George, J. R. Gilbert, and J. H. U. Liu, editors, Graph Theory and Sparse Matrix Computations, pages 1-29. Springer, 1993.
2. H.L. Bodlaender, T. Kloks, and D. Kratsch. Treewidth and pathwidth of permutation graphs. In Proceedings of the 20th International Col loquium on Automata, Languages and Programming (ICALP'93), Volume 700 of Lecture Notes in Computer Science, pages 114-125. Springer-Verlag, 1993.
3. M. C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, 1980.
4. R. Hayward. Weakly triangulated graphs. J. Combin. Theory ser. B, 39: 200-208, 1985.
5. T. Kloks. Treewidth of circle graphs. In Proceedings 4th Annual International Symposium on Algorithms and Computation (ISAAC'93), Volume 762 of Lecture Notes in Computer Science, pages 108-117. Springer-Verlag, 1993.
6. T. Kloks, H.L. Bodlaender, H. Mller, and D. Kratsch. Computing treewidth and minimum fill-in: All you need are the minimal separators. In Proceedings First Annual European Symposium on Algorithms (ESA'93), Volume 726 of Lecture Notes in Computer Science, pages 260-271. Springer-Verlag, 1993.
7. T. Kloks, H.L. Bodlaender, H. Mller, and D. Kratsch. Erratum to the ESA'93 proceedings. In Proceedings Second Annual European Symposium on Algorithms (ESA'94), Volume 855 of Lecture Notes in Computer Science, page 508. SpringerVerlag, 1994.
8. T. Kloks and D. Kratsch. Finding all minimal separators of a graph. In Proceedings 11th Annual Symposium on Theoretical Aspects of Computer Science (STACS'94), Volume 775 of Lecture Notes in Computer Science, pages 759-768. Springer-Verlag, 1994.
9. T. Kloks and D. Kratsch. Treewidth of chordal bipartite graphs. In Proceedings 11th Annual Symposium on Theoretical Aspects of Computer Science (STACS'94), Volume 775 of Lecture Notes in Computer Science, pages 759-768. Springer-Verlag, 1994.
10. A. Parra. Structural and Algorithmic Aspects of Chordal Graph Embeddings. PhD thesis, Technische Universität Berlin, 1996.
11. A. Parra and P. Scheffler. How to use the minimal separators of a graph for its chordal triangulation. In Proceedings of the 22nd International Colloquium on Automata, Languages and Programming (ICALP'95), Volume 994 of Lecture Notes in Computer Science, pages 123-134. Springer-Verlag, 1995.
12. N. Robertson and P. Seymour. Graphs minors. II. Algorithmic aspects of tree-width. J. of Algorithms, 7: 309-322, 1986.
13. J. Spinrad and R. Sritharan. Algorithms for weakly triangulated graphs. Discrete Applied Mathematics, 59: 181-191, 1995.
14. R. Sundaram, K. Sher Singh, and C. Pandu Rangan. Treewidth of circular-arc graphs. SIAM J. Discrete Math., 7: 647-655, 1994.