Treewidth for graphs with small chordality

Discrete Applied Mathematics

Volumn 79, Issue 1-3, 1997, Pages 45-61

  Bodlaender, Hans L ^a   Thilikos, Dimitrios M ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

Algorithms; NP complete problems; Separators in Graphs; Treewidth; Width

Indexed keywords

EID: 0041620189     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(97)00031-0     Document Type: Article

References (41)

1. N. Alon, P. Seymour, R. Thomas, A separator theorem for graphs with an excluded minor and its applications, Proc. 22nd ACM Symp. on the Theory of Computing, STOC'90, 1990, pp. 293-299.
2. N. Alon, R. Yuster, U. Zwick, Finding and counting given length cycles, Proc. 2nd Annual European Symp., ESA'94, Lecture Notes in Computer Science, vol. 855, Springer, Berlin, 1994, pp. 354-364.
3. R. Anand, H. Balakrishnan, C. Pandu Rangan, Treewidth of distance hereditary graphs, to appear.
4. R. Anderson, E. Mayr, Parallelism and greedy algorithms, Adv. Comput. Res. 4 (1987) 17-38. See also A P-complete problem and approximations to it, Technical Report, Dept. Computer Science, Stanford University, CA, 1984.
5. R. Anderson, E. Mayr, Parallelism and greedy algorithms, Adv. Comput. Res. 4 (1987) 17-38. See also A P-complete problem and approximations to it, Technical Report, Dept. Computer Science, Stanford University, CA, 1984.
6. S. Arnborg, Efficient algorithms for combinatorial problems on graphs with bounded decomposability (A survey), BIT 25 (1985) 2-33.
7. S. Arnborg, D.G. Corneil, A. Proskurowski, Complexity of finding embeddings in a k-tree, SIAM J. Algebraic and Discrete Methods 8 (1987) 277-284.
8. H.L. Bodlaender, A tourist guide through treewidth, Acta Cybernetica 11 (1993) 1-21.
9. H.L. Bodlaender, A linear time algorithm for finding tree-decompositions of small treewidth, SIAM J. Computing 25 (1996) 1305-1317.
10. H.L. Bodlaender, J.R. Gilbert, H. Hafsteinsson, T. Kloks, Approximating treewidth, pathwidth and minimum elimination tree height, J. Algorithms 18 (1995) 238-255.
11. H.L. Bodlaender, T. Hagerup, Parallel algorithms with optimal speedup for bounded treewidth, Proc. 22nd Internat. Colloquium on Automata, Languages and Programming, ICALP'95, Lecture Notes in Computer Science, vol. 944, Springer, Berlin, 1995, pp. 268-279.
12. H.L. Bodlaender, T. Kloks, Efficient and constructive algorithms for the pathwidth and treewidth of graphs, J. Algorithms 21 (1996) 358-402.
13. H.L. Bodlaender, T. Kloks, D. Kratsch, Treewidth and pathwidth of permutation graphs, SIAM J. Discrete Math. 8 (1995) 606-616.
14. H.L. Bodlaender, R.H. Möhring, The pathwidth and treewidth of cographs, SIAM J. Discrete Math. 6 (1993) 181-188.
15. H. Bollobás, Extremal graph theory with emphasis on probabilistic methods, Regional conference series in mathematics, No. 62, American Mathematical Society, Providence, RI, 1986.
16. A. Brandstädt, Special graph classes - a survey, Technical Report SM-DU-199, Universität Duisburg GH, 1991.
17. D.G. Corneil, S. Olariu, L. Stewart, Asteroidal triple-free graphs, Proc. 19th Internat. Workshop on Graph-Theoretic Concepts in Computer Science, WG'93, Lecture Notes in Computer Science, vol. 790, Springer, Berlin, 1994, pp. 211-224.
18. N.D. Dendris, L.M. Kirousis, D.M. Thilikos, Fugitive search games on graphs and related parameters, Theoret. Comput. Sci. 172 (1997) 233-254.
19. J.S. Deogun, Diametral path graphs, 2nd Internat. Conf. On Graph Theory and Algorithms, San Fransisco, 1989.
20. J.S. Deogun, D. Kratsch, Diametral path graphs, Proc. 21th Internat. Workshop on Graph-Theoretic Concepts in Computer Science, WG'95, Lecture Notes in Computer Science, vol. 1017, Springer, Berlin, 1995, pp. 344-357.
21. E.C. Freuder, A sufficient condition for backtrack-free search, J. ACM 29 (1982) 24-32.
22. T. Gallai, Transitiv orientierbare Graphen, Acta Math. Acad. Sci. Hungary 18 (1967) 25-66.
23. J. Gustedt, On the pathwidth of chordal graphs, Discrete Appl. Math. 45 (1993) 233-248.
24. R.B. Hayward, Weakly triangulated graphs, J. Combin Theory, Ser. B 39 (1985) 200-208.
25. L.M. Kirousis, D.M. Thilikos, The Linkage of a Graph, SIAM J. Comput. 25 (1996) 626-647.
26. T. Kloks, Treewidth of circle graphs, Technical report RUU-CS-93-12, Department of Computer Science, Utrecht University, Utrecht, The Netherlands, 1993.
27. T. Kloks, Treewidth, PhD thesis, Utrecht University, Utrecht, The Netherlands, 1993.
28. T. Kloks, H. Bodlaender, H. Müller, D. Kratsch, Computing treewidth and minimum fill-in: All you need are the minimal separators, in: T. Lengauer (Ed.), Proc. 1st Annual European Symp. on Algorithms ESA'93, Lecture Notes on Computer Science, vol. 726, Springer, Berlin, 1993, pp. 260-271.
29. T. Kloks, D. Kratsch, Treewidth of chordal bipartite graphs, J. Algorithms 19 (1995) 266-281.
30. C.E. Leiserson, Area efficient graph layouts (for VLSI), Proc. 21st Annual Symp. on Foundations of Computer Science, FOCS'80, 1980, pp. 270-281.
31. D.R. Lick, A.T. White, k-Degenerate graphs, Can. J. Math. 22 (1970) 1082-1096.
32. R.J. Lipton, D.J. Rose, R.E. Tarjan, Generalized nested dissection, SIAM J. Numer. Anal. 16 (1979) 346-358.
33. R.J. Lipton, R.E. Tarjan, A separator theorem for planar graphs, SIAM J. Appl. Math. 36 (1979) 177-189.
34. R.J. Lipton, R.E. Tarjan, Applications of a planar separator theorem, SIAM J. Comput. 9 (1980) 615-627.
35. D.W. Matula, A min-max theorem for graphs with application to graph coloring, SIAM Rev. 10 (1968) 481-482.
36. D.W. Matula, G. Marble, J.D. Isaacson, Graph coloring algorithms, Graph Theory and Comput., Academic Press, New York, 1972, pp. 109-122.
37. B. Monien, I.H. Sudborough, Min cut is NP-complete for edge weighted trees, Theoret. Comput. Sci. 58 (1988) 209-229.
38. N. Robertson, P.D. Seymour, Graph minors I. Excluding a forest, J. Combin. Theory., Ser. B 35 (1983) 39-61.
39. N. Robertson, P.D. Seymour, Graph minors III. Planar tree-width, J. Combin. Theory, Ser. B 36 (1984) 49-64.
40. N. Robertson, P.D. Seymour, Graph minors II: Algorithmic aspects of tree-width, J. Algorithms 7 (1986) 309-322.
41. R. Sundaram, K. Sher Singh, C. Pandu Rangan, Treewidth of circular-arc graphs, SIAM J. Discrete Math. 7 (1994) 647-655.