Treewidth and minimum fill-in: Grouping the minimal separators

SIAM Journal on Computing

Volumn 31, Issue 1, 2001, Pages 212-232

  Bouchitté, Vincent ^a   Todinca, Ioan ^a  

^a UNIV LYON   (France)

Author keywords

Graph algorithms; Minimum fill in; Treewidth; Weakly triangulated graphs

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; POLYNOMIALS; THEOREM PROVING;

GRAPH ALGORITHMS;

GRAPH THEORY;

EID: 0036215402     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539799359683     Document Type: Article

References (34)

1. S. ARNBORG, D. G. CORNEIL, AND A. PROSKUROWSKI, Complexity of finding embeddings in a k-tree, SIAM J. Algebraic Discrete Methods, 8 (1987), pp. 277-284.
2. J. R. S. BLAIR AND B. PEYTON, An introduction to chordal graphs and clique trees, in Graph Theory and Sparse Matrix Computations, A. George, J. R. Gilbert, and J. H. U. Liu, eds., Springer-Verlag, New York, 1993, pp. 1-29.
3. H. L. BODLAENDER, T. KLOKS, AND D. KRATSCH, Treewidth and pathwidth of permutation graphs, in Proceedings of the 20th International Colloquium on Automata, Languages and Programming (ICALP'93), Lecture Notes in Comput. Sci. 700, Springer-Verlag, Berlin, 1993, pp. 114-125.
4. V. BOUCHITTÉ AND I. TODINCA, Minimal triangulations for graphs with "few" minimal separators, in Proceedings of the Sixth Annual European Symposium on Algorithms (ESA'98), Lecture Notes in Comput. Sci. 1461, Springer-Verlag, Berlin, 1998, pp. 344-355.
5. V. BOUCHITTÉ AND I. TODINCA, Treewidth and minimum fill-in of weakly triangulated graphs, in Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science (STACS'99), Lecture Notes in Comput. Sci. 1563, Springer-Verlag, Berlin, 1999, pp. 197-206.
6. V. BOUCHITTÉ AND I. TODINCA, Listing all potential maximal cliques of a graph, in Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2000), Lecture Notes in Comput. Sci. 1770, Springer-Verlag, Berlin, 2000, pp. 503-515.
7. H. BROERSMA, T. KLOKS, D. KRATSCH, AND H. MÜLLER, A generalization of AT-free graphs and a generic algorithm for solving treewidth, minimum fill-in and vertex ranking, in Workshop on Graph-theoretic Concepts in Computer Science (WG'98), Lecture Notes in Comput. Sci. 1517, Springer-Verlag, Berlin, 1998, pp. 88-99.
8. H. J. BROERSMA, E. DAHLHAUS, AND T. KLOKS, Algorithms for the treewidth and minimum fill-in of HHD-free graphs, in Workshop on Graph-Theoretic Concepts in Computer Science (WG'97), Lecture Notes in Comput. Sci. 1335, Springer-Verlag, Berlin, 1997, pp. 109-117.
9. M. S. CHANG, Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs, in Proceedings of the Seventh Annual International Symposium on Algorithms and Computation (ISAAC'96), Lecture Notes in Comput. Sci. 1178, Springer-Verlag, Berlin, 1996, pp. 146-155.
10. G. A. DIRAC, On rigid circuit graphs, Abh. Math. Sem. Univ. Hamburg, 25 (1961), pp. 71-76.
11. 2) algorithm for circular-arc graph recognition, in Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'93), Austin, TX, 1993, pp. 128-137.
12. M. C. GOLUMBIC, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
13. R. HAYWARD, Weakly triangulated graphs, J. Combin. Theory Ser. B, 39 (1985), pp. 200-208.
14. R. HAYWARD, C. HOÀNG, AND F. MAFFRAY, Optimizing weakly triangulated graphs, Graphs Combin., 5 (1989), pp. 339-349.
15. T. KLOKS, Treewidth of circle graphs, in Proceedings of the Fourth Annual International Symposium on Algorithms and Computation (ISAAC'93), Lecture Notes in Comput. Sci. 762, Springer-Verlag, Berlin, 1993, pp. 108-117.
16. T. KLOKS, Treewidth of circle graphs, Internat. J. Found. Comput. Sci., 7 (1996), pp. 111-120.
17. T. KLOKS, private communication, University of Twente, 1998.
18. T. KLOKS, H. L. BODLAENDER, H. MÜLLER, AND D. KRATSCH, Computing treewidth and minimum fill-in: All you need are the minimal separators, in Proceedings of the First Annual European Symposium on Algorithms (ESA'93), Lecture Notes in Comput. Sci. 726, Springer-Verlag, Berlin, 1993, pp. 260-271.
19. T. KLOKS, H. L. BODLAENDER, H. MÜLLER, AND D. KRATSCH, Erratum to the ESA'93 proceedings, in Proceedings of the Second Annual European Symposium on Algorithms (ESA'94), Lecture Notes in Comput. Sci. 855, Springer-Verlag, Berlin, 1994, p. 508.
20. T. KLOKS AND D. KRATSCH, Treewidth of chordal bipartite graphs, J. Algorithms, 19 (1995), pp. 266-281.
21. T. KLOKS AND D. KRATSCH, Listing all minimal separators of a graph, SIAM J. Comput., 27 (1998), pp. 605-613.
22. T. KLOKS, D. KRATSCH, AND H. MÜLLER, Approximating the bandwidth for asteroidal triple-free graphs, in Proceedings of the Third Annual European Symposium on Algorithms (ESA'95), Lecture Notes in Comput. Sci. 979, Springer-Verlag, Berlin, 1995, pp. 434-447.
23. T. KLOKS, D. KRATSCH, AND J. SPINRAD, On treewidth and minimum fill-in of asteroidal triple-free graphs, Theoret. Comput. Sci., 175 (1997), pp. 309-335.
24. T. KLOKS, D. KRATSCH, AND C. K. WONG, Minimum fill-in of circle and circular-arc graphs, J. Algorithms, 28 (1998), pp. 272-289.
25. C. G. LEKKERKERKER AND J. CH. BOLAND, Representation of a finite graph by a set of intervals on the real line, Fund. Math., 51 (1962), pp. 45-64.
26. A. PARRA, Structural and Algorithmic Aspects of Chordal Graph Embeddings, Ph.D. thesis, Technische Universität Berlin, Berlin, Germany, 1996.
27. A. PARRA AND P. SCHEFFLER, Characterizations and algorithmic applications of chordal graph embeddings, Discrete Appl. Math., 79 (1997), pp. 171-188.
28. N. ROBERTSON AND P. SEYMOUR, Graphs minors. II. Algorithmic aspects of tree-width, J. Algorithms, 7 (1986), pp. 309-322.
29. D. J. ROSE, R. E. TARJAN, AND G. S. LUEKER, Algorithmic aspects of vertex elimination on graphs, SIAM J. Comput., 5 (1976), pp. 266-283.
30. J. SPINRAD, Recognition of circle graphs, J. Algorithms, 16 (1994), pp. 264-282.
31. J. SPINRAD AND R. SRITHARAN, Algorithms for weakly triangulated graphs, Discrete Appl. Math., 59 (1995), pp. 181-191.
32. R. SUNDARAM, K. SHER SINGH, AND C. PANDU RANGAN, Treewidth of circular-arc graphs, SIAM J. Discrete Math., 7 (1994), pp. 647-655.
33. I. TODINCA, Aspects Algorithmiques des Triangulations Minimales des Graphes, Ph.D. thesis, École Normale Supérieure de Lyon, Lyon, France, 1999.
34. M. YANNAKAKIS, Computing the minimum fill-in is NP-complete, SIAM J. Algebraic Discrete Methods, 2 (1981), pp. 77-79.