Treewidth and minimum fill-in of weakly triangulated graphs

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

Volumn 1563, Issue , 1999, Pages 197-206

  Bouchitté, Vincent ^a   Todinca, Ioan ^a  

^a UNIV LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION;

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

GRAPHIC METHODS;

EID: 84957046914     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49116-3_18     Document Type: Conference Paper

References (19)

1. V. Bouchitté and I. Todinca. Minimal triangulations for graphs with "few" minimal separators. In Proceedings 6th Annual European Symposium on Algorithms (ESA'98), volume 1461 of Lecture Notes in Computer Science, pages 344-355. Springer-Verlag, 1998.
2. H.J. Broersma, E. Dahlhaus, and T. Kloks. Algorithms for the treewidth and minimum fill-in of HHD-free graphs. In Workshop on Graphs (WG'97), volume 1335 of Lecture Notes in Computer Science, pages 109-117. Springer-Verlag, 1997.
3. M. S. Chang. Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs. In ISAAC'96, volume 1178 of Lecture Notes in Computer Science, pages 146-155. Springer-Verlag, 1996.
4. G.A. Dirac. On rigid circuit graphs. Abh. Math. Sem. Univ. Hamburg, 21:71-76, 1961.
5. M. C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, 1980.
6. R. Hayward. Weakly triangulated graphs. J. Combin. Theory ser. B, 39:200-208, 1985.
7. R. Hayward, C. Hoàng, and F. Maffray. Optimizing weakly triangulated graphs. Graphs Combin., 5:339-349, 1989.
8. 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.
9. T. Kloks, 1998. Private communication.
10. 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 First Annual European Symposium on Algorithms (ESA'93), volume 726 of Lecture Notes in Computer Science, pages 260-271. Springer-Verlag, 1993.
11. T. Kloks, H.L. Bodlaender, H. Müller, 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. Springer-Verlag, 1994.
12. T. Kloks and D. Kratsch. Treewidth of chordal bipartite graphs. J. Algorithms, 19(2):266-281, 1995.
13. T. Kloks, D. Kratsch, and H. Müller. Approximating the bandwidth for asteroidal triple-free graphs. In Proceedings Third Annual European Symposium on Algorithms (ESA'95), volume 979 of Lecture Notes in Computer Science, pages 434-447. Springer-Verlag, 1995.
14. T. Kloks, D. Kratsch, and J. Spinrad. On treewidth and minimum fill-in of asteroidal triple-free graphs. Theoretical Computer Science, 175:309-335, 1997.
15. T. Kloks, D. Kratsch, and C.K. Wong. Minimum fill-in of circle and circular-arc graphs. J. Algorithms, 28(2):272-289, 1998.
16. A. Parra and P. Scheffer. Characterizations and algorithmic applications of chordal graph embeddings. Discrete Appl. Math., 79(1-3):171-188, 1997.
17. N. Robertson and P. Seymour. Graphs minors. II. Algorithmic aspects of treewidth. J. of Algorithms, 7:309-322, 1986.
18. J. Spinrad and R. Sritharan. Algorithms for weakly triangulated graphs. Discrete Applied Mathematics, 59:181-191, 1995.
19. R. Sundaram, K. Sher Singh, and C. Pandu Rangan. Treewidth of circular-arc graphs. SIAM J. Discrete Math., 7:647-655, 1994.