Combinatorial optimization on graphs of bounded treewidth

Computer Journal

Volumn 51, Issue 3, 2008, Pages 255-269

  Bodlaender, Hans L ^a   Koster, Arie M C A ^b  

^a UTRECHT UNIVERSITY   (Netherlands)

^b UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

Bounded treewidth; Paramaterized algorithms

Indexed keywords

COMBINATORIAL OPTIMIZATION; DYNAMIC PROGRAMMING; SET THEORY; TREES (MATHEMATICS);

BOUNDED TREEWIDTH; TREE DECOMPOSITIONS; WEIGHTED INDEPENDENT SET PROBLEM;

GRAPH THEORY;

EID: 43249086767     PISSN: 00104620     EISSN: 14602067     Source Type: Journal    
DOI: 10.1093/comjnl/bxm037     Document Type: Article

References (98)

1. Harary, F. (1969) Graph Theory. Addison-Wesley, Reading, MA.
2. Hedetniemi, S.M., Hedetniemi, S.T. and Laskar, R. (1985) Domination in trees: Models and alaorithms. Graph Theory 442, New York, Wiley.
3. Mitchell, S.L. and Hedetniemi, S.T. (1979) Linear algorithms for edge-coloring trees and unicyclic graphs. Inf. Process. Lett., 9, pp. 110-112.
4. Shiloach, Y. (1979) A minimum linear arrangement algorithm for undirected trees. SIAM J. Comput., 8, pp. 15-32.
5. Bern, M.W., Lawler, E.L. and Wong, A.L. (1987) Linear time computation of optimal subgraphs of decomposable graphs. J. Algorithms, 8 pp. 216-235.
6. Borie, R.B., Parker, R.G. and Tovey, C.A. (1992) Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families. Algorithmica, 7, pp. 555-581.
7. Kikuno, T., Yoshida, B. and Kakuda, Y. (1982) A linear algorithm for the domination number of a series-parallel graphs. Discret. Appl. Math. 5, pp. 299-311.
8. Takamizawa, K., Nishizeki, T. and Saito, N. (11962.) Linear-time computability of combinatorial problems on series-parallel J ACM, 29, pp. 623-641.
9. Robertson, N. and Seymour, P.D. (2004) Graph minors. XX. Wagner's conjecture. J. Comb. Theory, Series B, 92, pp 325-357.
10. Robertson, N. and Seymour, P.D. (1983) Graph minors. I. Excluding a forest. J. Comb. Theory Series B, 35, pp. 39-61.
11. Robertson, N. and Seymour, P.D. (1986) Graph minors. II. Algorithmic aspects of tree-width. J. Algorithms, 7, pp. 309-322.
12. Robertson, N. and Seymour, P.D. (1991) Graph minors. X. Obstructions to tree-decomposition. J. Comb. Theory Series B, 52, pp. 153-190.
13. Bodlaender, H.L. (1998) A partial κ-arboretum of graphs with bounded treewidth. Theor. Comp. Sci., 209, pp. 1-45.
14. Bodlaender, H.L. and van Antwerpen-de Fluiter, B. (2001) Parallel algorithms for series parallel graphs and graphs with treewidth two. Algorithmica, 29, pp. 543-559.
15. Hliněný, P., Oum, S., Seese, D. and Gottlob, G. (2007) Width parameters beyond tree-width and their applications. The Computer Journal, this issue.
16. Hicks, I.V., Koster, A.M.C.A. and Kolotoǧlu, E. (2005) Branch and tree decomposition techniques for discrete optimization. In Smith, J.C. (ed), INFORMS Annual Meeting, TutORials 2005, INFORMS Tutorials in Operations Research Series, chapter1, pp. 1-29.
17. Downey, R.G. and Fellows, M.R. (1998) Parameterized Complexity. Springer.
18. Flum, J. and Grohe, M. (2006) Parameterized Complexity Theory. Springer.
19. Niedermeier. R. (2006) Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics and Its Applications. Oxford University Press.
20. Arnborg, S., Courcelle, B., Proskurowski, A. and Seese, D. (1993) An algebraic theory of graph reduction. J. ACM, 40, pp. 1134-1164.
21. Bodlaender, H.L. and van Antwerpen-de Fluiter, B. (2001) Reduction algorithms for graphs of small treewidth. Inf. Comput., 167, pp. 86-119.
22. Kloks, T. (1994) Treewidth. Computations and Approximations. Lecture Notes in Computer Science, vol. 842. Springer-Verlag, Berlin.
23. Thorup, M. (1998) Structured programs have small tree-width and good register allocation. Inf. Comput., 142, pp. 159-181.
24. Gustedt, J., Mæhle, O.A. and Telle, J.A. The treewidth of Java programs. In Mount, D.M. and Stein, C. (eds), Proc. 4th Int. Workshop on Algorithm Engineering and Experiments, pp. 86-97. Lecture Notes in Computer Science, vol. 2409, Springer-Verlag.
25. Burgstaller, B., Blieberger, J. and Scholz, B. (2004) On the tree width of Ada programs. In Lamosí, A. and Strohmeier, A. (eds), Proc. Ada-Europe Int. Conf. Reliable Software Technologies, pp. 78-90. Lecture Note in Computer Science, vol. 3063, Springer-Verlag.
26. Telle, J.A. and Proskurowski, A. (1997) Algorithms for vertex partitioning problems on partial k-trees. SIAM J. Discret. Math., 10, pp. 529-550.
27. Koster. A.M.C.A., van Hoesel, S.P.M. and Kolen, A.W.J. (2002) Solving partial constraint satisfaction problems with tree decomposition. Networks, 40, pp 170-180
28. Arnborg, S. and Proskurowski, A. (1989) Linear time algorithms for NP-hard problems restricted to partial k-trees. Discret. Appl. Math., 23, pp. 11-24.
29. Wimer, T.V., Hedetniemi, S.T. and Laskar, R. (1985) A methodology for constructing linear graph algorithms. Congr. Numer., 50, pp. 43-60.
30. Arnborg, S. (1985) Efficient algorithms for combinatorial problems on graphs with bounded decomposability - A survey. BIT, 25, pp. 2-23.
31. Aspvall, B., Proskurowski, A. and Telle, J.A. (2000) Memory requirements for table computations in partial k-tree algorithms. Algorithmica, 27, pp. 382-394.
32. Courcelle, B. (1990) The monadic second-order logic of graphs I: Recognizable sets of finite graphs. Inf. Comput., 85, pp. 12-75.
33. Arnborg, S., Lagergren, J. and Seese, D. (1991) Easy problems for tree decomposable graphs. J. Algorithms, 12, pp. 308-340.
34. Courcelle, B. and Mosbah, M. (1993) Monadic second-order evaluations on tree-decomposable graphs. Theor. Comp. Sci., 109, pp. 49-82.
35. Cooper, G.F. (1990) The computational complexity of probabilistic inference using Bayesian belief networks. Artif. Intell., 42 pp. 393-405.
36. Lauritzen, S.J. and Spiegelhalter, D.J. (1988) Local computations with probabilities on graphical structures and their application to expert systems. J. R. Stat. Soc.. Series B (Methodological), 50, pp. 157-224.
37. Fellow, M.R. and Langston, M.A. (1989) On search, decision and the efficiency of polynomial-time algorithms. Proc 21st Annual Symp. Theory of Computing, pp. 501-512.
38. Bodlaender, H.L. (1993) On linear time minor tests with depth first search. J. Algorithms, 14, pp. 1-23.
39. Gabow, H.N. (2007) Finding paths and cycles of superpolylogarithmic length. SIAM J. Comput., 36, pp. 1648-1671.
40. Guo, J., Gramm, J., Hüffner, F., Niedermeier, R. and Wernicke, S. (2005) Improved fixed-parameter algorithms for two feedback set problems. In Dehne, F.K.H.A., López-Ortiz, A., and Sack, J.-R. (eds). Proc. 9th Int. Workshop on Algorithms and Data Structures WADS 2005 pp. 158-168. Lecture. Notes in Computer Science, vol. 3608, Springer-Verlag.
41. Kanj, I.A., Pelsmajer, M.J. and Schaefer, M. (2004) Parameterized algorithms for feedback vertex set. In Downey, R.G. and Fellows, M.R. (eds), Proc. 1st Int. Workshop on Parameterized and Exact Computation, IWPEC 2004, pp. 235-248. Lecture Notes in Computer Science, vol. 3162, Springer-Verlag.
42. Arnborg, S., Corneil, D.G. and Proskurowski, A. (1987) Complexity of finding embeddings in a k-tree. SIAM J. Algebraic Discrete Methods, 8, pp. 277-284.
43. Bodlaender, H.L. and Thilikos, D.M. (1997) Treewidth for graphs with small chordality. Discret. Appl. Math., 79, pp. 45-61.
44. Bodlaender, H.L. (1996) A linear time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput., 25, pp. 1305-1317.
45. Röhrig, H. (1998) Tree decomposition: A feasibility study. Master's Thesis, Max-Planck-Institut für Informatik, Saarbrücken, Germany.
46. Shoikhet, K. and Geiger, D. (1997) A practical algorithm for finding optimal triangulations. Proc. Nat. Conf. on Artificial Intelligence (AAAI'97), pp. 185-190. Morgan Kaufmann.
47. Gogate, V. and Dechter, R. (2004) A complete anytime algorithm for treewidth. Proc. 20th Annual Conf. Uncertainty in Artificial Intelligence UAI-04, Arlington, VA, USA, pp. 201-208, AUAI Press.
48. Bodlaender, H.L., Fomin, F.V., Koster, A.M.C.A., Kratsch, D. and Thilikos, D.M. (2006) On exact algorithms for treewidth. In Azar, Y. and Erlebach, T. (eds), Proc. 14th Annual European Symp. Algorithms, ESA 2006, pp. 672-683. Lecture Notes in Computer Science, vol. 4168 Springer-Verlag.
49. Fomin, F.V., Kratsch, D. and Todinca, I. (2004) Exact (exponential) algorithms for treewidth and minimum fill-in. In Diaz, J., Karhumäki, J., Lepistö, A., and Sanella, D. (eds), Proc. 31st Int. Colloquium on Automata, Languages and Programming, ICALP 2004, pp. 568-580. Lecture Notes in Computer Science, vol. 3124, Springer-Verlag.
50. Villanger, Y. (2006) Improved exponential-time algorithms for treewidth and minimum fill-in. In Correa, J.R., Hevia, A. and Kiwi, M.A. (eds), Proc. 7th Latin American Theoretical Informatics Symposium, LATIN 2006 pp. 800-811. Lecture Notes in Computer Science, vol. 3887, Springer-Verlag.
51. Woeginger, G.J. (2003 Exact algorithms for NF-hard problems: A survey. In. Jünger, M., Reinelt, G., and Rinaldi, G. (eds). Combinatorial Optimization: 'Eureka, you shrink', pp. 185-207. Lecture Notes in Computer Science, vol. 2570, Springer-Verlag.
52. Bodlaender, H.L., Gilbert, J.R., Hafsteinson, H. and Kloks, T. (1995) Approximating treewidth, pathwidth, frontsize, and minimum elimination tree height. J. Algorithms, 18, pp. 238-255.
53. Amir, E. (2001) Efficient approximation for triangulation of minimum treewidth. In Breese, J.S. and Koller, P. (eds.), Proc. 17th Conf. Uncertainity in Artificial Intelligence, UAI'01., pp. 7-15, Morgan Kaufmann.
54. Amir, E. Approximation algorithms for treewidth. Algorithmica. To appear.
55. Bouchitté, V., Kratsch, D., Müller, H. and Todinca, I. (2004 On treewidth approximations. Discret. Appl. Math., 136, pp. 183-196.
56. Feige, U., Hajiaghayi, M. and Lee, J.R. (2005) Improved approximation algorithms for minimum-weight vertex separators. Proc. 37th Annual Symp. Theory of Computing, STOC 2005, pp. 563-572. ACM Press.
57. Lagergren, J. (1996) Efficient parallel algorithms for graphs of bounded tree-width. J. Algorithms, 20, pp. 20-44.
58. Reed, B. (1992) Finding approximate separators and computing tree-width quickly. Proc. of the 24th Annual Symp. Theory of Computing, pp. 221-228, New York, ACM Press.
59. Bodlaender, H.L. and Möhring, R.H. (1993) The pathwidth and treewidth of cographs. SIAM J. Discret. Math., 6, pp. 181-188.
60. Gavril, F. (1974) The intersection graphs of subtrees in trees are exactly the chordal graphs. J. Comb. Theory Series B, 16, pp. 47-56.
61. Golumbic, M.C. (1980) Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York.
62. Gavril, F. (1972) Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph. SIAM J. Comput., 1, pp. 180-187.
63. Rose, D.J. (1970) Triangulated graphs and the elimination process. J. Math. Anal. Appl., 32, pp. 597-609.
64. Rose, D.J. (1972) A graph-theoretic study of the numerical solution of sparse positive definite systems of linear equations. In Reed, R.C. (ed), Graph Theory and Computing, Academic Press. pp. 183-217.
65. Rose, D.J. Tarjan, R.E. and Lueker, G.S. (1976) Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput., 5, pp. 266-283.
66. Tarjan, R.E. and Yannakakis, M. (1984) Simple linear time algorithms to test chordiality of graphs, test acyclicity of graphs, and selectively reduce acyclic hypergraphs. SIAM J. Comput., 13, pp. 566-579.
67. Berry, A., Blair, J., Heggernes, P. and Peyton, B. (2004) Maximum cardinality search for computing minimal triangulations of graphs. Algorithmica, 39, pp. 287-298.
68. Dechter, R. and Pearl, J. (1989) Tree clustering for constraint networks. Acta Inform., 38, pp. 353-366.
69. Koster, A.M.C.A., Bodlaender, H.L. and van Hoesel, S.P.M. (2001) Treewidth: Computational experiments. In Broersma, H., Faigle, U., Hurink, J. and Pickl, S. (eds), Electronic Notes in Discrete Mathematics, vol. 8, pp. 54-57. Elsevier Science Publishers.
70. van den Broek. J.-W. and Bodlaender, H.L. (2004). TreewidthLIB. http://www.cs.uu.nl/people/hansb/treewidthlib.
71. Yannakakis, M. (1981) Computing the minimum fill-in is NP-complele. SIAM J. Algebraic Discret. Methods, 2, pp. 77-79.
72. Bachoore, E.H. and Bodlaender, H.L. (2005) New upper bound heuristics for treewidth. In Nikoletseas, S.E. (ed), Proc. 4th Int. Workshop Experimental and Efficient Algorithms WEA 2005, pp. 217-227. Lecture Notes in Computer Science, Vol. 3503, Springer-Verlag.
73. Clautiaux, F., Carlier, J., Moukrim, A. and Négre, S. (2003) New lower and upper bounds for graph treewidth. In Rolim, J.D.P. (ed), Proc. Int. Workshop on Experimental and Efficient Algorithms, WEA 2003 pp. 70-80. Lecture Notes in Computer Science, vol. 2647, Springer-Verlag.
74. Clautiaux F., Moukrim, A., Négre, S. and Carlier J. (2004) Heuristic and meta-heuristic methods fro computing graph treewidth. RAIRO Oper. Res., 38, pp. 13-26.
75. Koster, A.M.C.A. (1999). Frequency assignment - Models and algorithms Phd. Thesis, University Maastricht, Maastricht, The Netherlands.
76. Kjærulf, U. (1992) Optimal decomposition of probabilistic Networks by simulated annealing. Stat. Comput, 2, pp. 2-17.
77. Larrañaga, P., Kuijpers, C.M.H., Poza, M. and Murga, R.H. (1997) Decomposing Bayesian networks: Triangular of the moral graph with genetic algorithms. Statistics and Computing (UK), 7, pp. 19-34.
78. Scheffler, P. (1989) Die Baumweite von Graphen als ein Maß für die Kompliziertheit algorithmischer Probleme. PhD Thesis, Akademie der Wissenschaften der DDR, Berlin.
79. Bodlaender, H.L., Koster, A.M.C.A. and Wolle, T. (2006) Contraction and treewidth lower bounds, J. Graph Algorithms Appl., 10, pp. 5-49.
80. Koster, A.M.C.A., Wolle, T. and Bodlaender, H.L. (2005) Degree-based treewidth lower bounds. In Nokoletseas, S.E. (ed), Proc. 4th Int. Workshop on Experimental and Efficient Algorithms WEA 2005, pp. 101-112. Lecture Notes in Computer Science, vol. 3503 Springer-Verlag.
81. Lucena, B. (2003) A New lower bound for tree-width using maximum cardinality search. SIAM J. Discret. Math,, 16, pp. 345-353.
82. Bodlaender, H.L. and Koster, A.M.C.A. (2007) On the maximum cardinality search lower bound for treewidth. in Hromkovič, J., Nagl, M. and Westfechtel, B. (eds), Discret. Appl. Math., 155, pp. 1348-1372.
83. Bodlaender, H.L. (2003) Necessary edges in k-chordalizations of graphs. J. Comb Optim, 7, pp. 283-290.
84. Bodlaender, H.L., Grigoriev, A. and Koster, A.M.C.A. (2005) treewidth lower bounds with brambles. In Brodal, G.S. and Leonardi, S. (eds), Proc. 13th Annual European Symp. Algorithms, ESA 2005, pp. 391-402. Lecture Notes in Computer Science, vol. 3669, Springer-Verlag.
85. Seymour, P.D. and Thomas, R. (1993) Graph searching and a minimax theorem for tree-width. J. Comb. Theory Series B, 58, pp. 239-257.
86. Lipton, R.J. and Tarjan, R.E. (1979) A separator theorem for planar graphs. SIAM J. Appl. Math., 36, pp. 177-189.
87. Lipton, R.J. and Tarjan, R.E. (1980). Applications of a planar separator theorem. SIAM J. Comput., 9, pp. 615-627.
88. Seymour, P.D. and Thomas, R. (1994) Call routing and the ratcatcher. Combinatorica, 14, pp. 217-241.
89. Hicks, I.V. (2005) Planar branch decompositions I: The ratcatcher. INFORMS J. Comput. 17 pp. 402-412.
90. Hicks. I. V. (2005) Planar Branch decompositions II: The cycle method. INFORMS J. Comput. 17, pp. 413-421.
91. Dorn F., Penninkx, E., Bodlaender, H.L. and Fomin, F.V. (2005) Efficient exact algorithms on planar graphs: Exploiting sphere cut branch decompositions. In Brodal, S. and Leonardi, S. (eds), Proc. 13th Annual European Symp. Algorithms ESA' 2005, pp. 95-106. Lecture Notes in Computer Science, vol. 3669, Springer-Verlag.
92. Alber, J., Bodlaender, H.L., Fernau, H., Kloks, T. and Niedermeier, R. (2002) Fixed parameter algorithms for dominating set and related problems on planar graphs. Algorithmica, 33, pp. 461-493.
93. Baker, B.S. (1994) Approximation algorithms for NP-complete problems on planar graphs. J. ACM, 41, pp. 153-180.
94. Demaine, E. D. and Hajiaghayi M. (2007) The bidimensionality theory and its algorithm applications. The Computer Journal, this issue.
95. Hliněný, P. and Whittle, G. (2006) Matroid tree-width. European J. Combinatorics, 27, pp. 1117-1128.
96. Gottlob, G., Leone, N. and Scarcello, F. (2002) Hypertree decompositions and tractable queries. J. Comp. Syst. Sci., 64, pp, 579-627.
97. Eijkhof, F.v.d., Bodlaender, H.L. and Koster, A.M.C.A. (2007) Safe reduction rules for weighted treewidth. Algorithmica, 47, pp. 138-158.
98. Bodlaender, H.L. and Fomin, F.V. (2004) Tree decompositions with small cost. Discret. Appl. Math., 145, 143-154.