Computing the treewidth and the minimum fill-in with the modular decomposition

Algorithmica (New York)

Volumn 36, Issue 4, 2003, Pages 375-408

  Bodlaender, Hans L ^a   Rotics, Udi ^b  

^a UTRECHT UNIVERSITY   (Netherlands)

^b NETANYA ACADEMIC COLLEGE   (Israel)

Author keywords

Graph algorithms; Minimal separators; Minimum fill in; Modular decomposition; Polynomial algorithms; Treewidth

Indexed keywords

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; INTEGRATED CIRCUIT LAYOUT; MATRIX ALGEBRA; POLYNOMIALS; VLSI CIRCUITS;

GRAPH ALGORITHMS; MINIMAL SEPARATORS; MINIMUM FILL-IN; MODULAR DECOMPOSITION; POLYNOMIAL ALGORITHMS; TREEWIDTH;

ALGORITHMS;

EID: 0942300999     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-003-1026-5     Document Type: Article

References (28)

1. S. Arnborg. Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey. BIT, 25:2-23, 1985.
2. S. Arnborg, D. G. Corneil, and A. Proskurowski. Complexity of finding embeddings in a k-tree. SIAM J. Algebraic Discrete Methods, 8:277-284, 1987.
3. 4's. Discrete Appl. Math., 89:45-57, 1998.
4. A. Berry, J.-P. Bordat, and O. Cogis. Generating all minimal separators of a graph. In Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science, WG '99, pages 167-172, 1999.
5. H. L. Bodlaender. A partial k-arboretum of graphs with bounded treewidth. Theoret. Comput. Sci., 209:1-45, 1998.
6. H. L. Bodlaender, J. R. Gilbert, H. Hafsteinsson, and T. Kloks. Approximating treewidth, pathwidth, frontsize, and minimum elimination tree height. J. Algorithms, 18:238-255, 1995.
7. H. L. Bodlaender, T. Kloks, and D. Kratsch. Treewidth and pathwidth of permutation graphs. SIAM J. Discrete Math., 8(4):606-616, 1995.
8. H. L. Bodlaender and R. H. Möhring. The pathwidth and treewidth of cographs. SIAM J. Discrete Math., 6:181-188, 1993.
9. V. Bouchitté and I. Todinca. Treewidth and minimum fill-in: grouping the minimal separators. SIAM J. Comput., 31:212-232, 2001.
10. V. Bouchitté and I. Todinca. Listing all potential maximal cliques of a graph. Theoret. Comput. Sci., 276:17-32, 2002.
11. H. Broersma, E. Dahlhaus, and T. Kloks. Algorithms for the treewidth and minimum fill-in of HHD-free graphs. In Proceedings of the 23rd International Workshop on Graph-Theoretic Concepts in Computer Science, WG '97, pages 109-117. Lecture Notes in Computer Science, vol. 1335. Springer-Verlag, Berlin, 1997.
12. H. Broersma, E. Dahlhaus, and T. Kloks. A linear time algorithm for minimum fill in and treewidth for distance hereditary graphs. Discrete Appl. Math., 99:367-400, 2000.
13. H. Buer and R. H. Möhring. A fast algorithm for the decomposition of graphs and posets. Math. Oper. Res., 8(2):170-184, 1983.
14. A. Cournier and M. Habib. A new linear algorithm for modular decomposition. In T. Sophie, editor, Trees in Algebra and Programming, CAAP '94, pages 68-84. Lecture Notes in Computer Science, vol. 787. Springer-Verlag, Berlin, 1994.
15. E. Dahlhaus. Minimum fill-in and treewidth for graphs modularly decomposable into chordal graphs. In Proceedings of the 24th International Workshop on Graph-Theoretic Concepts in Computer Science, WG '98, pages 351-358. Lecture Notes in Computer Science, vol. 1517. Springer-Verlag, Berlin, 1998.
16. E. Dahlhaus, J. Gustedt, and R. M. McConnell. Efficient and practical modular decomposition. J. Algorithms, 41:360-387, 2001.
17. G. Dirac. On rigid circuit graphs. Abh. Math. Sem. Univ. Hamburg, 25:71-76, 1961.
18. F. Gavril. The intersection graphs of subtrees in trees are exactly the chordal graphs. J. Combin. Theory Ser. B, 16:47-56, 1974.
19. M. C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, 1980.
20. T. Kloks. Treewidth of circle graphs. Internat. J. Found. Comput. Sci., 7:111-120, 1996.
21. T. Kloks and D. Kratsch. Listing all minimal separators of a graph. SIAM J. Comput., 27(3):605-613, 1998.
22. T. Kloks, D. Kratsch, and H. Müller. Approximating the bandwidth for asteroidal triple-free graphs. J. Algorithms, 32:41-57, 1999.
23. T. Kloks, D. Kratsch, and J. Spinrad. On treewidth and minimum fill-in of asteroidal triple-free graphs. Theoret. Comput. Sci., 175:309-335, 1997.
24. R. M. McConnell and J. Spinrad. Modular decomposition and transitive orientation. Discrete Math., 201:189-241, 1999.
25. R. H. Möhring. Graph problems related to gate matrix layout and PLA folding. In E. Mayr, H. Noltemeier, and M. Syslo, editors, Computational Graph Theory, Computing Suppl. 7, pages 17-51. Springer-Verlag, Berlin, 1990.
26. N. Robertson and P. D. Seymour. Graph minors. II. Algorithmic aspects of tree-width. J. Algorithms, 7:309-322, 1986.
27. R. Sundaram, K. Sher Singh, and C. Pandu Rangan. Treewidth of circular-arc graphs. SIAM J. Discrete Math., 7:647-655, 1994.
28. M. Yannakakis. Computing the minimum fill-in is NP-complete. SIAM J. Algebraic Discrete Methods, 2:77-79, 1981.