Graphs with Branchwidth at Most Three

Journal of Algorithms

Volumn 32, Issue 2, 1999, Pages 167-194

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

^a UTRECHT UNIVERSITY   (Netherlands)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Branchwidth; Graph algorithms; Graph minors; Obstruction set; Reduction rule

Indexed keywords

EID: 0038521894     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1999.1011     Document Type: Article

References (23)

1. S. Arnborg, D. G. Corneil, and A. Proskurowski, Complexity of finding embeddings in a k-tree, SIAM J. Alg. Discrete Methods 8 (1987), 277-284.
2. S. Arnborg, B. Courcelle, A. Proskurowski, and D. Seese, An algebraic theory of graph reduction, J. Assoc. Comput. Mach. 40 (1993), 1134-1164.
3. S. Arnborg and A. Proskurowski, Characterization and recognition of partial 3-trees, SIAM J. Alg. Disc. Meth. 7 (1986), 305-314.
4. S. Arnborg, A. Proskurowski, and D. G. Corneil, Forbidden minors characterization of partial 3-trees, Discrete Math. 80 (1990), 1-19.
5. H. L. Bodlaender, "A Partial k-Arboretum of Graphs with Bounded Treewidth," Theor. Comp. Sc. 209 (1998), 1-45.
6. H. L. Bodlaender, T. Kloks, and D. Kratsch, Treewidth and pathwidth of permutation graphs, SIAM J. Disc. Meth. 8, No. 4 (1995), 606-616.
7. H. L. Bodlaender and D. M. Thilikos, Constructive linear-time algorithms for branch-width, in "Proceedings 24th International Colloquium on Automata, Languages, and Programming" (P. Degano, R. Gorrieri, and A. Marchetti-Spaccamela, Eds.), Lecture Notes in Computer Science, Vol. 1256, pp. 627-637, Springer-Verlag, New York/Berlin, 1997.
8. H. L. Bodlaender, J. van Leeuwen, R. Tan, and D. Thilikos, On interval routing schemes and treewidth, Inform. and Comput. 139, No. 1 (1997), 92-109.
9. W. Cook, 1996. Personal communication.
10. W. Cook and P. D. Seymour, An algorithm for the ring-routing problem, Bellcore technical memorandum, Bellcore, 1993.
11. F. Gavril, The intersection graphs of subtrees in trees are exactly the chordal graphs, J. Combin. Theory Ser. B 16 (1974), 47-56.
12. Y. Kajitani, A. Ishizuka, and S. Ueno, A characterization of the partial k-tree in terms of certain substructures, Graphs Combin. 2 (1986), 233-246.
13. T. Kloks, "Treewidth. Computations and Approximations," Lecture Notes in Computer Science, Vol. 842, Springer-Verlag, Berlin, 1994.
14. J. Matoušek and R. Thomas, Algorithms finding tree-decompositions of graphs, J. Algorithms 12 (1991), 1-22.
15. N. Robertson and P. D. Seymour, Graph minors - A survey in "Surveys in Combinatorics" (I. Anderson, Ed.), pp. 153-171, Cambridge Univ. Press, Cambridge, 1985.
16. N. Robertson and P. D. Seymour, Graph minors. X. Obstructions to tree-decomposition, J. Comb. Theory Series B, 52 (1991), 153-190.
17. D. P. Sanders, On linear recognition of tree-width at most four, SIAM J. Disc. Meth., 9, No. 1 (1996), 101-117.
18. A. Satyanarayana and L. Tung, A characterization of partial 3-trees, Networks 20 (1990), 299-322.
19. P. D. Seymour and R. Thomas, Call routing and the ratcatcher, Combinatorica 14, No. 2 (1994), 217-241.
20. J. van Leeuwen, Graph algorithms, in Handbook of Theoretical Computer Science, A: Algorithms and Complexity Theory, pp. 527-631, North Holland, Amsterdam, 1990.
21. J. A. Wald and C. J. Colburn, Steiner trees, partial 2-trees, and minimum IFI networks, Networks 13 (1983), 159-167.
22. M. Yannakakis, Computing the minimum fill-in is NP-complete, SIAM J. Alg. Disc. Meth. 2 (1981), 950-988.
23. M. Yannakakis and F. Gavril, The maximum k-colorable subgraph problem for chordal graphs, Inform. Proc. Lett. 24 (1987), 133-137.