Branch Decompositions and Minor Containment

Networks

Volumn 43, Issue 1, 2004, Pages 1-9

  Hicks, Illya V ^a  

^a TEXAS A AND M UNIVERSITY   (United States)

Author keywords

Branch decomposition; Branchwidth; Dynamic programming; Graph minor; Minor containment; Obstruction set

Indexed keywords

BRANCH DECOMPOSITION; BRANCHWIDTH; GRAPH MINOR; MINOR CONTAINMENT; OBSTRUCTION SET;

ALGORITHMS; COMPUTER GRAPHICS; COMPUTER SIMULATION; DECOMPOSITION; DYNAMIC PROGRAMMING; GRAPHIC METHODS; INTEGER PROGRAMMING; THEOREM PROVING;

GRAPH THEORY;

EID: 2042546751     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/net.10099     Document Type: Article

References (42)

1. J. Alber and R. Niedermeier, Improved tree decomposition based algorithms for domination-like problems, Proc 5th Latin American Theoretical Informatics (LATIN 2002), Heidelberg, Germany, Springer-Verlag, 2002, pp. 613-627.
2. S. Arnborg, J. Lagergren, and D. Seese, Easy problems for tree-decomposable graphs, J Alg 12 (1991), 308-340.
3. H. Bodlaender, A tourist guide through treewidth, Acta Cybernet 11 (1993), 1-21.
4. H. Bodlaender, A linear time algorithm for finding tree-decompositions of small treewidth, SIAM J Comput 25 (1996), 1305-1317.
5. H. Bodlaender, Treewidth: Algorithmic techniques and results, Proc 22nd Int Symp on Mathematical Foundations of Computer Science (MFCS 1997), Heidelburg, Germany, Springer-Verlag, 1997, pp. 29-36.
6. H. Bodlaender, A partial k-arboretum of graphs with bounded treewidth, Theor Comput Sci 209 (1998), 1-45.
7. H. Bodlaender and T. Kloks, Efficient and constructive algorithms for the pathwidth and treewidth of graphs, J Alg 21 (1996), 358-402.
8. H. Bodlaender and D. Thilikos, Constructive linear time algorithms for branchwidth, Proc 24th Int Colloq on Automata, Languages, and Programming, Heidelburg, Germany, Springer-Verlag, 1997, pp. 627-637.
9. H. Bodlaender and D. Thilikos, Graphs with branchwidth at most three, J Alg 32 (1999), 167-194.
10. R. Borie, R. Parker, and C. Tovey, Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families, Algorithmica 7 (1992), 555-581.
11. W.A. Christian, Linear-time algorithms for graphs with bounded branchwidth, Ph.D. thesis, Rice University, 2002.
12. W. Cook and P.D. Seymour, An algorithm for the ring-router problem, Tech Report, Bellcore, 1994.
13. W. Cook and P.D. Seymour, Tour merging via branch-decomposition, INFORMS J Comput 15 (2003), 233-248.
14. B. Courcelle, The monadic second-order logic of graphs 1: Recognizable sets of finite graphs, Info Comput 85 (1990), 12-75.
15. M. Garey and D. Johnson, Computers and intractability, W. H. Freeman, New York, 1979.
16. J. Geelen, A. Gerards, and G. Whittle, Branch width and well-quasi-ordering in matroids and graphs, J Combin Theory B 84 (2002), 270-290.
17. I.V. Hicks, Branch decompositions and their applications, Ph.D. thesis, Rice University, 2000.
18. I.V. Hicks, Branchwidth heuristics, Cong Num (to appear).
19. I.V. Hicks, Planar branch decompositions I: The ratcatcher, preprint, 2003.
20. I.V. Hicks, Planar branch decompositions II: The cycle method, preprint, 2003.
21. D. Johnson and M. Trick (Editors), Cliques, coloring and satisfiability: Second DIMACS implementation challenge, AMS, Providence, RI, 1996.
22. T. Kloks, J. Kratochvil, and H. Müller, New branchwidth territories, Proc 16th Ann Symp on Theoretical Aspects of Computer Science, Heidelberg, Germany, Springer-Verlag, 1999, pp. 173-183.
23. A. Koster, S. van Hoesel, and A. Kolen, Solving frequency assignment problems via tree-decomposition, Elect Notes Discr Math 3 (1999), 1-4.
24. A. Koster, H. Bodlaender, and S. van Hoesel, Treewidth: Computational experiments, Elect Notes Discr Math 8 (2001), 1-4.
25. D. Kreher and D. Stinson, Combinatorial algorithms, CRC Press, Boca Raton, FL, 1999.
26. J. Maharry, An excluded minor theorem for the the octahedron, J Graph Theory 31 (1999), 95-100.
27. S. Ramachandramurthi, The structure and number of obstructions to treewidth, SIAM J Discr Math 10 (1997), 146-157.
28. B. Reed, Finding approximate separators and computing tree width quickly, Proc 24th Ann ACM Symp on Theory of Computing, ACM Press, New York, 1992, pp. 221-228.
29. B. Reed, "Tree width and tangles: A new connectivity measure and some applications," Survey in Combinatorics, R. Bailey (Editor), Cambridge University Press, Cambridge, UK, 1997, pp. 87-162.
30. N. Robertson and P.D. Seymour, Graph minors I: Excluding a forest, J Combin Theory B 35 (1983), 39-61.
31. N. Robertson and P.D. Seymour, "Graph minors: A survey," Surveys in Combinatorics, I. Anderson (Editor), Cambridge University Press, Cambridge, UK, 1985, pp. 153-171.
32. N. Robertson and P.D. Seymour, Graph minors X: Obstructions to tree-decompositions, J Combin Theory B 52 (1991), 153-190.
33. N. Robertson and P.D. Seymour, Graph minors XIII: The disjoint paths problem, J Combin Theory B 63 (1995), 65-110.
34. P.D. Seymour and R. Thomas, Graph searching and a min-max theorem for tree-width, J Combin Theory B 58 (1993), 22-33.
35. P.D. Seymour and R. Thomas, Call routing and the ratcatcher, Combinatorica 14 (1994), 217-241.
36. H. Tamaki, A linear time heuristic for the branch-decomposition of planar graphs, Tech report MPI-I-2003-1-010, Max-Planck-Institut Fur Informatick, 2003.
37. J. Telle and A. Proskurowski, Algorithms for vertex partitioning problems on partial k-trees, SIAM J Discr Math 10 (1997), 529-550.
38. R. Thomas, A Menger-like property of tree-width: The finite case, J Combin Theory B 48 (1990), 67-76.
39. R. Thomas, "Recent excluded minor theorems for graphs," Surveys in Combinatorics, J.D. Lamb and D.A. Preece (Editors), Cambridge University Press, Cambridge, UK, 1999, pp. 201-222.
40. C. Thomassen, A simpler proof of the excluded minor theorem for higher surfaces, J Combin Theory B 70 (1997), 306-311.
41. M. Thorup, All structured programs have small tree width and good register allocation, Info Comput 142 (1998), 159-181.
42. D. Welsh, Complexity: Knots, colourings and counting, Cambridge University Press, Cambridge, UK, 1993.