A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs

Discrete Applied Mathematics

Volumn 99, Issue 1-3, 2000, Pages 367-400

  Broersma, H J ^a   Dahlhaus, E ^b   Kloks, T ^a  

^a UNIVERSITY OF TWENTE   (Netherlands)

^b UNIVERSITY OF BONN   (Germany)

Author keywords

Chordal graphs; Distance hereditary graphs; Fragment tree; Linear time algorithm; Minimum fill in; Tree representation; Treewidth

Indexed keywords

EID: 0345618553     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(99)00146-8     Document Type: Article

References (23)

1. Arnborg S., Corneil D.G., Proskurowski A. Complexity of finding embeddings in a. k -tree SIAM J. Algebra Discrete Math. 8:1987;277-284.
2. Bandelt H.J., Mulder H.M. Distance-hereditary graphs. J. Combin. Theory (B). 41:1986;182-208.
3. H. Bodlaender, T. Kloks, D. Kratsch, H. Müller, Treewidth and minimum fill-in on d -trapezoid graphs, Technical Report RUU-CS- 1995 -34, Utrecht University, The Netherlands, 1995.
4. Bodlaender H., Kloks T., Kratsch D. Treewidth and pathwidth of permutation graphs. SIAM J. Discrete Math. 8:1995;606-616.
5. H. Bodlaender, R. Möhring, The pathwidth and treewidth of cographs, Proceedings of the second Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science, vol. 447, Springer, Berlin, 1990, pp. 301-309.
6. A. Brandstädt, Special graph classes - A survey, Schriftenreihe des Fachbereichs Mathematik, SM-DU-199, Universität Duisburg Gesamthochschule, 1991.
7. H.J. Broersma, E. Dahlhaus, T. Kloks, Algorithms for the treewidth and minimum fill-in of HHD-free graphs, Memorandum No. 1356, Faculty of Applied Mathematics, University of Twente, Enschede, The Netherlands, 1996.
8. M.S. Chang, Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs, proceedings ISAAC'96, Lecture Notes in Computer Sccience, Vol. 1178, Springer, Berlin, 1996, pp. 146-155.
9. Dahlhaus E. Efficient parallel recognition algorithms of cographs and distance hereditary graphs. Discrete Appl. Math. 57:1995;29-44.
10. Dirac G.A. On rigid circuit graphs. Abh. Math. Sem. Univ. Hamburg. 25:1961;71-76.
11. Fulkerson D., Gross O. Incidence matrices and interval graphs. Pacific J. Math. 15:1965;835-855.
12. Hammer P.L., Maffray F. Completely separable graphs. Discrete Appl. Math. 27:1990;85-99.
13. T. Kloks, Treewidth - Computations and Approximations, Lecture Notes in Computer Science, vol. 842, Springer, Berlin, 1994.
14. Kloks T. Treewidth of circle graphs. Int. J. Found. Comput. Sci. 7:1996;111-120.
15. Kloks T., Kratsch D. Treewidth of chordal bipartite graphs. J. Algorithms. 19:1995;266-281.
16. T. Kloks, D. Kratsch, H. Müller, Approximating the bandwidth for AT-free graphs, Proceedings of the Third Annual European Symposium on Algorithms (ESA'95), Lecture Notes in Computer Science, vol. 979, Springer, Berlin, 1995, pp. 434-447.
17. T. Kloks, D. Kratsch, J. Spinrad, Treewidth and pathwidth of cocomparability graphs of bounded dimension, Computing Science Notes 93 / 46, Eindhoven University of Technology, Eindhoven, The Netherlands, 1993.
18. T. Kloks, D. Kratsch, C.K. Wong, Minimum fill-in of circle and circular arc graphs, Proceedings of the 21st International Symposium on Automata, Languages and Programming (ICALP'96), Lecture Notes in Computer Science, vol. 1113, Springer, Berlin, 1996, pp. 256-267.
19. F. Nicolai, Hamilton Problems on Distance Hereditary Graphs, Technical Report TR SM-DU-264, University of Duisburg, 1994 .
20. A. Parra, P. Scheffler, How to use minimal separators for its chordal triangulation, Proceedings of the 20th International Symposium on Automata, Languages and Programming (ICALP'95), Lecture Notes in Computer Science, vol. 944, Springer, Berlin, 1995, pp. 123-134.
21. D. Rose, Triangulated graphs and the elimination process, J. Math. Analysis and Appl. 32 (1970) 597-609.
22. R. Sundaran, K. Sher Singh, C. Pandu Rangan, Treewidth of circular-arc graphs, Siam J. Disc. Math. 7 (1994) 647- 655.
23. M. Yannakakis, Computing the minimum fill-in is NP-complete, Siam J. Alg. Disc. Math. 2 (1981) 77-79.