Algorithms for the treewidth and minimum fill-in of HHD-free graphs

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

Volumn 1335, Issue , 1997, Pages 109-117

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

^a UNIVERSITY OF TWENTE   (Netherlands)

^b UNIVERSITY OF BONN   (Germany)

Author keywords

Algorithms; Graphs; HHD free graphs; Minimum fill in; Treewidth

Indexed keywords

ALGORITHMS; GRAPH THEORY; POLYNOMIAL APPROXIMATION;

CLIQUE NUMBER; FREE GRAPHS; GRAPHS; INDUCED SUBGRAPHS; POLYNOMIAL-TIME; SUPERGRAPH; TREE-WIDTH;

GRAPHIC METHODS;

EID: 84949671623     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0024492     Document Type: Conference Paper

References (21)

1. Arnborg, S., D. G. Corneil and A. Proskurowski, Complexity of finding embeddings in a k-tree, SIAM J. Alg. Disc. Meth. 8, (1987), pp. 277-284.
2. Bodlaender, H., T. Kloks, D. Kratsch and H. Miiller, Treewidth and minimum fillin on d-trapezoid graphs, Technical report PtUU-CS-1995-34, Utrecht University, The Netherlands, 1995.
3. Bodlaender, H. and R. MShring, The pathwidth and treewidth of cographs, SIAM Journal on Discrete Mathematics 7 (1993), pp. 181-188.
4. Brandstädt, A., Special graph classes-A survey, Sehriftenreihe des Fachbereiehs Mathematik, SM-DU-199 (1991), Universität Duisburg Gesamthoehschule.
5. Maw-Shang Chang, Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs. ISAAC'96 (T. Asano et al. ed.), LLNCS 1178, pp. 146-155.
6. Dirac, G. A., On rigid circuit graphs, Abh. Math. Sere. Univ. Hamburg 25, (1961), pp. 71-76.
7. Golumbic M. C., Algorithmic graph theory and perfect graphs, Academic Press, New York, 1980.
8. Hammer, P. L. and F. Maffray, Completely separable graphs, Discrete Applied Mathematics 27, (1990), pp. 85-99.
9. Hayward, R., C. T. Hoang and F. Maffray, Optimizing weakly triangulated graphs, Graphs and eorabinatorics 5, (1989), pp. 339-349.
10. Jamison, B. and S. Olariu, On the semi-perfect elimination, Advances in Applied Mathematics 9, (1988), pp. 364-376.
11. Kloks, T., Treewidth-Computations and Approximations, Springer Verlag, Lecture Notes in Computer Science 842, (1994).
12. Kloks, T., Treewidth of circle graphs, International Journal of Foundations of Computer Science 7, (1996), pp. 111-120.
13. Kloks, T. and D. Kratsch, Treewidth of chordal bipartite graphs, J. of Algorithms 19, (1995), pp. 266-281.
14. Kloks, T., D. Kratsch and H. Müller, Approximating the bandwidth for ATfree graphs, Proceedings of the Third Annual European Symposium on Algorithms (ESA '95), Springer-Verlag, Lecture Notes in Computer Science 979, (1995), pp. 434-447.
15. Kloks, T., D. Kratsch and J. Spinrad, Treewidth and pathwidth of cocomparability graphs of bounded dimension, Computing Science Notes, 93/46, Eindhoven University of Technology, Eindhoven, The Netherlands, (1993), to appear in Order.
16. Kloks, T., D. Kratsch and C. K. Wong, Minimum fill-in of circle and circular arc graphs, Proceedings of the 21 th [nternational Symposium on Automata, Languages and Programming (ICALP'96), Springer-Verlag Lecture Notes in Computer Science 1113, (1996), pp. 256-267.
17. Olariu, S., Results on perfect graphs, PhD thesis, Scool of Computer Science, McGill University, Montreal, 1986.
18. Parra, A., Scheffler, P., How to use minimal separators for its chordal triangulation, ICALP'95, LLNCS 944, pp. 123-134.
19. Spinrad, J., A. Brandstädt and L. Stewart, Bipartite permutation graphs, Discrete Applied mathematics 18, (1987), pp. 279-292.
20. Sundaram, R., K. Sher Singh and C. Pandu Rangan, Treewidth of circular arc graphs. To appear in SIAM J. Disc. Math.
21. Yannakakis, M., Computing the minimum fill-in is NP-complete, SIAM J. Alg. Disc. Meth. 2, (1981), pp. 77-79.