Treewidth: Algorithmic Techniques and Results

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

Volumn 1295, Issue , 1997, Pages 19-36

  Bodlaender, Hans L ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ALGORITHMIC TECHNIQUES; BOUNDED TREEWIDTH; GRAPH MINORS; TREE-WIDTH;

GRAPH ALGORITHMS;

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

References (134)

1. K. A. Abrahamson, R. G. Downey, and M. R. Fellows. Fixed-parameter tractability and completeness IV: On completeness for W[P] and PSP ACE analogues. Annals of Pure and Applied Logic, 73:235-276, 1995.
2. K. R. Abrahamson and M. R. Fellows. Finite automata, bounded treewidth and well-quasiordering. In N. Robertson and P. Seymour, editors, Proceedings of the AMS Summer Workshop on Graph Minors, Graph Structure Theory, Contemporary Mathematics vol. 147, pages 539-564. American Mathematical Society, 1993.
3. S. Arnborg. Some PSP ACE-complete logic decision problems that become linear time solvable on formula graphs of bounded treewidth. Manuscript, 1991.
4. S. Arnborg. Graph decompositions and tree automata in reasoning with uncertainty. J. Expt. Theor. Artif. Intell., 5:335-357, 1993.
5. S. Arnborg, D. G. Corneil, and A. Proskurowski. Complexity of finding embeddings in a fc-tree. SIAM J. Alg. Disc. Meth., 8:277-284, 1987.
6. S. Arnborg, B. Courcelle, A. Proskurowski, and D. Seese. An algebraic theory of graph reduction. J. ACM, 40:1134-1164, 1993.
7. S. Arnborg, J. Lagergren, and D. Seese. Easy problems for tree-decomposable graphs. J. Algorithms, 12:308-340, 1991.
8. S. Arnborg and A. Proskurowski. Characterization and recognition of partial 3- trees. SIAM J. Alg. Disc. Meth., 7:305-314, 1986.
9. S. Arnborg and A. Proskurowski. Linear time algorithms for NP-hard problems restricted to partial fc-trees. Disc. Appl. Math., 23:11-24, 1989.
10. S. Arnborg and A. Proskurowski. Canonical representations of partial 2- and 3-trees. BIT, 32:197-214, 1992.
11. S. Arnborg, A. Proskurowski, and D. G. Corneil. Forbidden minors characterization of partial 3-trees. Disc. Math., 80:1-19, 1990.
12. S. Arnborg, A. Proskurowski, and D. Seese. Monadic second order logic, tree automata and forbidden minors. In E. Borger, H. Kleine Biining, M. M. Richter, and W. Schonfeld, editors, Proceedings Jtth Workshop on Computer Science Logic, CSL’90, pages 1-16. Springer Verlag, LNCS, vol. 533, 1991.
13. M. W. Bern, E. L. Lawler, and A. L. Wong. Linear time computation of optimal subgraphs of decomposable graphs. J. Algorithms, 8:216-235, 1987.
14. D. Bienstock. Graph searching, path-width, tree-width and related problems (a survey). DIM ACS Ser. in Discrete Mathematics and Theoretical Computer Science, 5:33-49, 1991.
15. D. Bienstock and M. A. Langston. Algorithmic implications of the graph minor theorem. To appear as chapter in: Handbook of Operations Research and Management Science: Volume on Networks and Distribution, 1993.
16. D. Bienstock, N. Robertson, P. D. Seymour, and R. Thomas. Quickly excluding a forest. J. Comb. Theory Series B, 52:274-283, 1991.
17. H. L. Bodlaender. NC-algorithms for graphs with small treewidth. In J. van Leeuwen, editor, Proceedings 14th International Workshop on Graph-Theoretic Concepts in Computer Science WG’88, pages 1-10. Springer Verlag, LNCS, vol. 344, 1988.
18. H. L. Bodlaender. Polynomial algorithms for graph isomorphism and chromatic index on partial fc-trees. J. Algorithms, 11:631-643, 1990.
19. H. L. Bodlaender. Complexity of path-forming games. Theor. Comp. Sc., 110:215-245, 1993.
20. H. L. Bodlaender. On linear time minor tests with depth first search. J. Algorithms, 14:1-23, 1993.
21. H. L. Bodlaender. A tourist guide through treewidth. Acta Cybernetics, 11:1-23, 1993.
22. H. L. Bodlaender. Dynamic algorithms for graphs with treewidth 2. In Proceedings 19th International Workshop on Graph-Theoretic Concepts in Computer Science WG’93, pages 112-124, Berlin, 1994. Springer Verlag.
23. H. L. Bodlaender. On disjoint cycles. Int. J. Found. Computer Science, 5(1):59-68, 1994.
24. H. L. Bodlaender. A linear time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput., 25:1305-1317, 1996.
25. H. L. Bodlaender. A partial fc-arboretum of graphs with bounded treewidth. Tech. Rep. UU-CS-1996-02, Dep. of Comp. Sc., Utrecht Univ., Utrecht, 1996.
26. H. L. Bodlaender and B. de Pluiter. Reduction algorithms for constructing solutions in graphs with small treewidth. In J.-Y. Cai and C. K. Wong, editors, Proceedings 2nd Annual International Conference on Computing and Combinatorics, COCOON’96, pages 199-208. Springer Verlag, LNCS, vol. 1090, 1996.
27. H. L. Bodlaender and J. Engelfriet. Domino treewidth. To appear in J. Algorithms, 1997.
28. H. L. Bodlaender, M. R. Fellows, and M. Hallett. Beyond JVP-completeness for problems of bounded width: Hardness for the W hierarchy. In Proceedings of the 26th Annual Symposium on Theory of Computing, pages 449-458, New York, 1993. ACM Press.
29. H. L. Bodlaender, M. R. Fellows, M. T. Hallett, H. T. Wareham, and T. J. Warnow. The hardness of problems on thin colored graphs. Tech. Rep. UU- CS-1995-36, Dep. of Comp. Sc., Utrecht Univ., Utrecht, 1995.
30. H. L. Bodlaender, J. R. Gilbert, H. Hafsteinsson, and T. Kloks. Approximating treewidth, pathwidth, and minimum elimination tree height. J. Algorithms, 18:238-255, 1995.
31. H. L. Bodlaender and T. Hagerup. Parallel algorithms with optimal speedup for bounded treewidth. In Z. Fiilop and F. Gecseg, editors, Proceedings 22nd International Colloquium on Automata, Languages and Programming, pages 268-279, Berlin, 1995. Springer-Verlag, LNCS 944.
32. H. L. Bodlaender and T. Kloks. Efficient and constructive algorithms for the pathwidth and treewidth of graphs. J. Algorithms, 21:358-402, 1996.
33. H. L. Bodlaender, T. Kloks, and D. Kratsch. Treewidth and pathwidth of permutation graphs. SIAM J. Disc. Meth., 8(4):606-616, 1995.
34. H. L. Bodlaender and R. H. Mohring. The pathwidth and treewidth of cographs. SIAM J. Disc. Meth., 6:181-188, 1993.
35. H. L. Bodlaender, R. B. Tan, D. M. Thilikos, and J. van Leeuwen. On interval routing schemes and treewidth. In M. Nagl, editor, Proceedings 21th International Workshop on Graph Theoretic Concepts in Computer Science WG’95, pages 181-186. Springer Verlag, LNCS, vol. 1017, 1995.
36. H. L. Bodlaender and D. M. Thilikos. Treewidth and small separators for graphs with small chordality. Tech. Rep. UU-CS-1995-02, Dep. of Comp. Sc., Utrecht Univ., Utrecht, 1995. To appear in Disc. Appl. Math.
37. H. L. Bodlaender and D. M. Thilikos. Constructive linear time algorithms for branchwidth. To appear in Proceedings ICALP’97, 1997.
38. R. B. Borie. Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs. Algorithmica, 14:123-137, 1995.
39. R. B. Borie, R. G. Parker, and C. A. Tovey. Deterministic decomposition of recursive graph classes. SIAM J. Disc. Meth., 4:481-501, 1991.
40. H. Broersma, E. Dahlhaus, and T. Kloks. A linear time algorithm for minimum fill in and tree width for distance hereditary graphs. In U. Faigle and C. Hoede, editors, Scientific program 5th Twente Workshop on Graphs and Combinatorial Optimization, pages 48-50, 1997.
41. K. Cattell, M. J. Dinneen, and M. R. Fellows. Obstructions to within a few vertices or edges of acyclic. In Proceedings 4th Int. Workshop on Algorithms and Data Structures. Springer Verlag, LNCS, vol. 955, 1995.
42. K. Cattell, M. J. Dinneen, and M. R. Fellows. A simple linear-time algorithm for finding path-decompositions of small width. Inform. Proc. Letters, 57:197-204, 1996.
43. N. Chandrasekharan and S. T. Hedetniemi. Fast parallel algorithms for tree decomposing and parsing partial fc-trees. In Proc. 26th Annual Allerton Conference on Communication, Control, and Computing, Urbana-Champaign, Illinois, 1988.
44. S. Chaudhuri and C. D. Zaroliagis. Optimal parallel shortest paths in small treewidth digraphs. In P. Spirakis, editor, Proceedings 3rd Annual European Symposium on Algorithms ESA ’95, pages 31-45. Incs979, 1995.
45. R. F. Cohen, S. Sairam, R. Tamassia, and J. S. Vitter. Dynamic algorithms for optimization problems in bounded tree-width graphs. In Proceedings of the 3rd Conference on Integer Programming and Combinatorial Optimization, pages 99-69, 1993.
46. W. Cook and P. D. Seymour. An algorithm for the ring-routing problem. Bellcore technical memorandum, Bellcore, 1993.
47. B. Courcelle. The monadic second-order logic of graphs II: Infinite graphs of bounded width. Mathematical Systems Theory, 21:187-221, 1989.
48. B. Courcelle. Graph rewriting: an algebraic and logical approach. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 192-242, Amsterdam, 1990. North Holland Publ. Comp.
49. B. Courcelle. The monadic second-order logic of graphs I: Recognizable sets of finite graphs. Information and Computation, 85:12-75, 1990.
50. B. Courcelle. The monadic second-order logic of graphs V: On closing the gap between definability and recognizability. Theor. Comp. Sc., 80:153-202, 1991.
51. B. Courcelle. The monadic second-order logic of graphs III: Treewidth, forbidden minors and complexity issues. Informatique Theorique, 26:257-286, 1992.
52. B. Courcelle and J. Lagergren. Equivalent definitions of recognizability for sets of graphs of bounded tree-width. Mathematical Structures in Computer Science, 6:141-166, 1996.
53. B. Courcelle and M. Mosbah. Monadic second-order evaluations on tree-decomposable graphs. Theor. Comp. Sc., 109:49-82, 1993.
54. B. de Fluiter. Algorithms for Graphs of Small Treewidth. PhD thesis, Utrecht Univ., 1997.
55. B. de Fluiter and H. L. Bodlaender. Parallel algorithms for treewidth two, 1997. To appear in Proceedings WG’97.
56. M. J. Dinneen. Bounded Combinatorial Width and Forbidden Substructures. PhD thesis, Univ. of Victoria, 1995.
57. R. G. Downey and M. R. Fellows. Fixed-parameter tractability and completeness III: Some structural aspects of the W hierarchy. In K. Ambos-Spies, S. Homer, and U. Schoning, editors, Complexity Theory, pages 191-226. Cambridge Univ. Press, 1993.
58. R. G. Downey and M. R. Fellows. Fixed-parameter tractability and completeness I: Basic results. SIAM J. Comput., 24:873-921, 1995.
59. R. G. Downey and M. R. Fellows. Fixed-parameter tractability and completeness II: On completeness for W[l], Theor. Comp. Sc., 141:109-131, 1995.
60. J. A. Ellis, I. H. Sudborough, and J. Turner, The vertex separation and search number of a graph. Information and Computation, 113:50-79, 1994.
61. D. Eppstein. Subgraph isomorphism in planax graphs and related problems. In Proceedings SODA’95, 1995.
62. M. R. Fellows and M. A. Langston. Nonconstructive advances in polynomial-time complexity. Inform. Proc. Letters, 26:157-162, 1987.
63. M. R. Fellows and M. A. Langston. Nonconstructive tools for proving polynomialtime decidability. J. ACM, 35:727-739, 1988.
64. M. R. Fellows and M. A. Langston. On search, decision and the efficiency of polynomial-time algorithms. In Proceedings of the 21rd Annual Symposium on Theory of Computing, pages 501-512, 1989.
65. M. R. Fellows and M. A. Langston. Fast search algorithms for layout permutation problems. Int. J. on Computer Aided VLSI Design, 3:325-340, 1991.
66. M. R. Fellows and M. A. Langston. On well-partial-order theory and its application to combinatorial problems of VLSI design, SIAM J. Disc. Meth., 5:117-126, 1992.
67. M. R. Fellows and M. A. Langston. On search, decision and the efficiency of polynomial-time algorithms. J. Comp. Syst. Sc., 49:769-779, 1994.
68. D. Fernandez-Baca and A. Medipalli. Parametric module allocation on partial fc-trees. IEEE Trans, on Computers, 42:738-742, 1993.
69. D. Fernandez-Baca and G. Slutzki. Parametic problems on graphs of bounded treewidth. J. Algorithms, 16:408-430, 1994.
70. G. N. Frederickson. Maintaining regular properties dynamically in fc-terminal graphs. Manuscript. To appear in Algorithmica., 1993.
71. G. N. Frederickson and R. Janaidan. Designing networks with compact routing tables. Algorithmica, 3:171-190, 1988.
72. R. Garbe. Tree-width and path-width of comparability graphs of interval orders. In E. W. Mayr, G. Schmidt, and G. Tinhofer, editors, Proceedings 20th International Workshop on Graph Theoretic Concepts in Computer Science WG’94, pages 26-37, Springer Verlag, LNCS, vol. 903, 1995.
73. C. Gavoille, On the dilation of interval routing. In: Proceedings MFCS’97, 1997.
74. K. Y. Gorbunov. An estimate of the tree-width of a graph which has not a given planar grid as a minor. Manuscript, 1993.
75. D. Granot and D. Skorin-Kapov, NC algorithms for recognizing partial 2-trees and 3-trees. SIAM J. Disc. Meth., 4(3):342-354, 1991.
76. A. Gupta and N. Nishimura. The complexity of subgraph isomorphism: Duality results for graphs of bounded path- and tree-width. Tech. Rep. CS-95-14, Univ. of Waterloo, Comp. Sc. Dep., Waterloo, Ontario, Canada, 1995.
77. E. M. Gurari and I. H. Sudborough. Improved dynamic programming algorithms for bandwidth minimization and the mincut linear arrangement problem. J. Algorithms, 5:531-546, 1984.
78. J. Gustedt. On the pathwidth of chordal graphs. Disc. Appl. Math., 45(3):233-248, 1993.
79. M. Habib and R. H. Mohring. Treewidth of cocomparability graphs and a new order-theoretic parameter. ORDER, 1:47-60, 1994.
80. T. Hagerup. Dynamic algorithms for graphs of bounded treewidth. To appear in Proceedings ICALP’97, 1997.
81. T. Hagerup, J. Katajainen, N. Nishimura, and P. Ragde. Characterizations of k-terminal flow networks and computing network flows in partial k-trees. In Proceedings SODA ’95, 1995.
82. K. Jansen and P. Scheffler. Generalized coloring for tree-like graphs. In Proceedings 18th International Workshop on Graph-Theoretic Concepts in Computer Science WG’92, pages 50-59, Berlin, 1993. Springer Verlag, LNCS, vol. 657.
83. D. Kaller. Definability equals recognizability of partial 3-trees. In Proceedings 22nd International Workshop on Graph-Theoretic Concepts in Computer Science WG ’96, pages 239-253. Springer Verlag, LNCS, vol. 1197, 1997.
84. H. Kaplan and R. Shamir. Pathwidth, bandwidth and completion problems to proper interval graphs with small cliques. SIAM J. Comput., 25:540-561, 1996.
85. H. Kaplan, R. Shamir, and R. E. Tarjan. Tractability of parameterized completion problems on chordal and interval graphs: Minimum fill-in and physical mapping. In Proceedings of the 35th annual symposium on Foundations of Computer Science (FOCS), pages 780-791. IEEE Computer Science Press, 1994.
86. N. G. Kinnersley and M. A. Langston. Obstruction set isolation for the gate matrix layout problem. Disc. Appl. Math., 54:169-213, 1994.
87. T. Kloks, Treewidth of circle graphs. In Proceedings Forth International Symposium on Algorithms and Computation, ISAAC’93, pages 108-117, Berlin, 1993. Springer Verlag, LNCS, vol. 762.
88. T. Kloks. Treewidth. Computations and Approximations. LNCS, Vol. 842. Springer-Verlag, Berlin, 1994.
89. T. Kloks and D. Kratsch. Treewidth of chordal bipartite graphs. J. Algorithms, 19:266-281, 1995.
90. E. Korach and N. Solel. Linear time algorithm for minimum weight Steiner tree in graphs with bounded treewidth. Manuscript, 1990.
91. A. Kornai and Z. Tuza. Narrowness, pathwidth, and their application in natural language processing. Disc. Appl. Math., 36:87-92, 1992.
92. J. Lagergren. Efficient parallel algorithms for graphs of bounded tree-width. J. Algorithms, 20:20-44, 1996.
93. S. J. Lauritzen and D. J. Spiegelhalter. Local computations with probabilities on graphical structures and their application to expert systems. J. of the Royal Statistical Society. Series B (Methodological), 50:157-224, 1988.
94. S. Mahajan and J. G. Peters. Regularity and locality in fc-terminal graphs. Disc. Appl. Math., 54:229-250, 1994.
95. E. Mata-Montero. Resilience of partial fc-tree networks with edge and node failures. Networks, 21:321-344, 1991.
96. J. Matousek and R. Thomas. On the complexity of finding iso- and other morphisms for partial k-trees. Disc. Math., 108:343-364, 1992.
97. B. Monien. The bandwidth minimization problem for caterpillars with hair length 3 is NP-complete. SIAM J. Alg. Disc. Meth., 7:505-512, 1986.
98. A. Parra. Structural and Algorithmic Aspects of Chordal Graph Embeddings. PhD thesis, Tech. Univ. Berlin, 1996.
99. S. Ramachandramurthi. Algorithms for VLSI Layout Based on Graph Width Metrics. PhD thesis, Comp. Sc. Dep., Univ. of Tennessee, Knoxville, Tennessee, USA, 1994.
100. S. Ramachandramurthi. The structure and number of obstructions to treewidth. SIAM J. Disc. Meth., 10:146-157, 1997.
101. N. Robertson and P. D. Seymour. Graph minors. XX. Wagner’s conjecture. In prepartion.
102. N. Robertson and P. D. Seymour. Graph minors. I. Excluding a forest. J. Comb. Theory Series B, 35:39-61, 1983.
103. N. Robertson and P. D. Seymour. Graph minors. III. Planar tree-width. J. Comb. Theory Series B, 36:49-64, 1984.
104. N. Robertson and P. D. Seymour. Graph minors. II. Algorithmic aspects of treewidth. J. Algorithms, 7:309-322, 1986.
105. N. Robertson and P. D. Seymour. Graph minors. V. Excluding a planar graph. J. Comb. Theory Series B, 41:92-114, 1986.
106. N. Robertson and P. D. Seymour. Graph minors. VI. Disjoint paths across a disc. J. Comb. Theory Series B, 41:115-138, 1986.
107. N. Robertson and P. D. Seymour. Graph minors. VII. Disjoint paths on a surface. J. Comb. Theory Series B, 45:212-254, 1988.
108. N. Robertson and P. D. Seymour. Graph minors. IV. Tree-width and well-quasi- ordering. J. Comb. Theory Series B, 48:227-254, 1990.
109. N. Robertson and P. D. Seymour. Graph minors. IX. Disjoint crossed paths. J. Comb. Theory Series B, 49:40-77, 1990.
110. N. Robertson and P. D. Seymour. Graph minors. VIII. A Kuratowski theorem for general surfaces. J. Comb. Theory Series B, 48:255-288, 1990.
111. N. Robertson and P. D. Seymour. Graph minors. X. Obstructions to tree- decomposition. J. Comb. Theory Series B, 52:153-190, 1991.
112. N. Robertson and P. D. Seymour. Graph minors. XVI. Excluding a non-planar graph. Manuscript, 1991.
113. N. Robertson and P. D. Seymour. Graph minors. XVII. Taming a vortex. Manuscript, 1991.
114. N. Robertson and P. D. Seymour. Graph minors. XXI. Graphs woth unique linkages. Manuscript, 1992.
115. N. Robertson and P. D. Seymour. Graph minors. XXII. Irrelevant vertices in linkage problems. Manuscript, 1992.
116. N. Robertson and P. D. Seymour. Graph minors. XI. Distance on a surface. J. Comb. Theory Series B, 60:72-106, 1994.
117. N. Robertson and P. D. Seymour. Graph minors. XII. Excluding a non-planar graph. J. Comb. Theory Series B, 64:240-272, 1995.
118. N. Robertson and P. D. Seymour. Graph minors. XIII. The disjoint paths problem. J. Comb. Theory Series B, 63:65-110, 1995.
119. N. Robertson and P. D. Seymour. Graph minors. XIV. Extending an embedding. J. Comb. Theory Series B, 65:23-50, 1995.
120. N. Robertson and P. D. Seymour. Graph minors. XV. Giant steps. J. Comb. Theory Series B, 68:112-148, 1996.
121. N. Robertson, P. D. Seymour, and R. Thomas. Quickly excluding a planar graph. J. Comb. Theory Series B, 62:323-348, 1994.
122. D. P. Sanders. On linear recognition of tree-width at most four. SIAM J. Disc. Meth., 9(1):101-117, 1996.
123. A. Satyanarayana and L. Tung. A characterization of partial 3-trees. Networks, 20:299-322, 1990.
124. J. B. Saxe. Dynamic programming algorithms for recognizing small-bandwidth graphs in polynomial time. SIAM J. Alg. Disc. Meth., 1:363-369, 1980.
125. P. Scheffler. A practical Unear time algorithm for disjoint paths in graphs with bounded tree-width. Report 396/1994, TU Berlin, Fachbereich Mathematik, Berlin, 1994.
126. P. D. Seymour and R. Thomas. Call routing and the ratcatcher. Combinatorial, 14(2):217-241, 1994.
127. R. Sundaram, K. Sher Singh, and C. Pandu Rangan. Treewidth of circular-arc graphs. SIAM J. Disc. Meth., 7:647-655, 1994.
128. A. Takahashi, S. Ueno, and Y. Kajitani. Minimal acyclic forbidden minors for the family of graphs with bounded path-width. Disc. Math., 127(l/3):293-304, 1994.
129. J. Telle and A. Proskurowski. Efficient sets in partial fc-trees. Disc. Appl. Math,., 44:109-117, 1993.
130. J. Telle and A. Proskurowski. Practical algorithms on partial fc-trees with an application to domination-like problems. In Proceedings of Workshop on Algorithms and Data Structures WADS’93, pages 610-621. Springer Verlag, LNCS, vol. 700, 1993.
131. M. Thorup. Structured programs have small tree-width and good register allocation. Tech. Rep. DIKU-TR-95/18, Dep. of Comp. Sc., Univ. of Copenhagen, Denmark, 1995. To appear in: Proceedings WG’97.
132. E. Wanke. Bounded tree-width and LOGCFL. J. Algorithms, 16:470-491, 1994.
133. T. V. Wimer. Linear Algorithms on k-Terminal Graphs. PhD thesis, Dept, of Comp. Sc., Clemson Univ., 1987.
134. X. Zhou, S. Nakano, and T. Nishizeki. Edge-coloring partial fc-trees. J. Algorithms, 21:598-617, 1996.