Treewidth: Characterizations, applications, and computations

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

Volumn 4271 LNCS, Issue , 2006, Pages 1-14

  Bodlaender, Hans L ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CHARACTERIZATION; COMPUTATION THEORY;

TREEWIDTH;

TREES (MATHEMATICS);

EID: 33845532829     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11917496_1     Document Type: Conference Paper

References (66)

1. J. Alber, F. Dorn, and R. Niedermeier. Experimental evaluation of a tree decomposition based algorithm for vertex cover on planar graphs. Disc. Appl. Math., 145:210-219, 2005.
2. E. Amir. Efficient approximation for triangulation of minimum treewidth. In Proceedings of the 17th Conference on Uncertainty in Artificial Intelligence, pages 7-15, 2001.
3. S. Arnborg. Efficient algorithms for combinatorial problems on graphs with bounded decomposability - A survey. BIT, 25:2-23, 1985.
4. S. Arnborg, D. G. Cornell, and A. Proskurowski. Complexity of finding embeddings in a k-tree. SIAM J. Alg. Disc. Meth., 8:277-284, 1987.
5. S. Arnborg, J. Lagergren, and D. Seese. Easy problems for tree-decomposable graphs. J. Algorithms, 12:308-340, 1991.
6. S. Arnborg and A. Proskurowski. Characterization and recognition of partial 3-trees. SIAM J. Alg. Disc. Meth., 7:305-314, 1986.
7. S. Arnborg and A. Proskurowski. Linear time algorithms for NP-hard problems restricted to partial k-trees. Disc. Appl. Math., 23:11-24, 1989.
8. E. H. Bachoore and H. L. Bodlaender. New upper bound heuristics for treewidth. In S. E. Nikoletseas, editor, Proceedings of the 4th International Workshop on Experimental and Efficient Algorithms WEA 2005, pages 217-227. Springer Verlag, Lecture Notes in Computer Science, vol. 3503, 2005.
9. E. H. Bachoore and H. L. Bodlaender. A branch and bound algorithm for exact, upper, and lower bounds on treewidth. In S.-W. Cheng and C. K. Poon, editors, Proceedings 2nd International Conference on Algorithmic Aspects in Information and Management, AAIM 2006, Lecture Notes in Computer Science, vol. 4041, pages 255-266, 2006.
10. A. Becker and D. Geiger. A sufficiently fast algorithm for finding close to optimal clique trees. Artificial Intelligence, 125:3-17, 2001.
11. A. Berry, J. R. S. Blair, and P. Heggernes. Maximum cardinality search for computing minimal triangulations. In L. Kučera, editor, Proceedings 28th Int. Workshop on Graph Theoretic Concepts in Computer Science, WG'02, pages 1-12. Springer Verlag, Lecture Notes in Computer Science, vol. 2573, 2002.
12. J. R. S. Blair, P. Heggernes, and J. Telle. A practical algorithm for making filled graphs minimal. Theor. Comp. Sc., 250:125-141, 2001.
13. H. L. Bodlaender. A tourist guide through treewidth. Acta Cybernetica, 11:1-23, 1993.
14. H. L. Bodlaender. A linear time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput., 25:1305-1317, 1996.
15. H. L. Bodlaender. A partial k-arboretum of graphs with bounded treewidth. Theor. Comp. Sc., 209:1-45, 1998.
16. H. L. Bodlaender. Discovering treewidth. In P. Vojtáš, M. Bieliková, and B. Charron-Bost, editors, SOFSEM 2005: Theory and Practive of Computer Science: 31st Conference on Current Trends in Theory and Practive of Computer Science, pages 1-16. Springer-Verlag, Lecture Notes in Computer Science 3381, 2005.
17. H. L. Bodlaender, F. V. Fomin, A. M. C. A. Koster, D. Kratsch, and D. M. Thilikos. On exact algorithms for treewidth. In Y. Azar and T. Erlebach, editors, Proceedings 14th Annual European Symposium on Algorithms ESA 2006, pages 672-683. Springer Verlag, Lecture Notes in Computer Science, vol. 4168, 2006.
18. H. L. Bodlaender, A. Grigoriev, and A. M. C. A. Koster. Treewidth lower bounds with brambles. In G. S. Brodal and S. Leonardi, editors, Proceedings 13th Annual European Symposium on Algorithms, ESA2005, pages 391-402. Springer-Verlag, Lecture Notes in Computer Science, vol. 3669, 2005.
19. H. L. Bodlaender and A. M. C. A. Koster. On the Maximum Cardinality Search lower bound for treewidth. In J. Hromkovič, M. Nagl, and B. Westfechtel, editors, Proc. 30th International Workshop on Graph- Theoretic Concepts in Computer Science WG 2004, pages 81-92. Springer-Verlag, Lecture Notes in Computer Science 3353, 2004.
20. H. L. Bodlaender and A. M. C. A. Koster. Safe separators for treewidth. Disc. Math., 306:337-350, 2006.
21. H. L. Bodlaender, A. M. C. A. Koster, and F. v. d. Eijkhof. Pre-processing rules for triangulation of probabilistic networks. Computational Intelligence, 21(3):286-305, 2005.
22. H. L. Bodlaender, A. M. C. A. Koster, and T. Wolle. Contraction and treewidth lower bounds. In S. Albers and T. Radzik, editors, Proceedings 12th Annual European Symposium on Algorithms, ESA2004, pages 628-639. Springer, Lecture Notes in Computer Science, vol. 3221, 2004.
23. H. L. Bodlaender, A. M. C. A. Koster, and T. Wolle. Contraction and treewidth lower bounds. Journal of Graph Algorithms and Applications, 10:5-49, 2006.
24. H. L. Bodlaender and R. H. Möhring. The pathwidth and treewidth of cographs. SIAM J. Disc. Math., 6:181-188, 1993.
25. B. Bollobás. Modern Graph Theory. Graduate Texts in Mathematics, Springer, New York, 1998.
26. R. B. Borie. Recursively Constructed Graph Families. PhD thesis, School of Information and Computer Science, Georgia Institute of Technology, 1988.
27. R. B. Borie, R. G. Parker, and C. A. Tovey. Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families. Algorithmica, 7:555-581, 1992.
28. V. Bouchitté and I. Todinca. Treewidth and minimum fill-in: Grouping the minimal separators. SIAM J. Comput., 31:212-232, 2001.
29. V. Bouchitté and I. Todinca. Listing all potential maximal cliques of a graph. Theor. Comp. Sc., 276:17-32, 2002.
30. F. Clautiaux, J. Carlier, A. Moukrim, and S. Négre. New lower and upper bounds for graph treewidth. In J. D. P. Rolim, editor, Proceedings International Work-shop on Experimental and Efficient Algorithms, WEA 2003, pages 70-80. Springer Verlag, Lecture Notes in Computer Science, vol. 2647, 2003.
31. F. Clautiaux, A. Moukrim, S. Négre, and J. Carlier. Heuristic and meta-heuristic methods for computing graph treewidth. RAIRO Operations Research, 38:13-26, 2004.
32. W. Cook and P. D. Seymour. Tour merging via branch-decomposition. INFORMS J. on Computing, 15(3):233-248, 2003.
33. B. Courcelle. The monadic second-order logic of graphs I: Recognizable sets of finite graphs. Information and Computation, 85:12-75, 1990.
34. K. Dohmen, A. Pönitz, and P. Tittmann. A new two-variable generalization of the chromatic polynomial. Disc. Math. and Theor. Comp. Sc., 6:69-90, 2004.
35. F. v. d. Eijkhof, H. L. Bodlaender, and A. M. C. A. Koster. Safe reduction rules for weighted treewidth. To appear in Algorithmica.
36. F. V. Fomin, D. Kratsch, and I. Todinca. Exact (exponential) algorithms for treewidth and minimum fill-in. In Proceedings of the 31st International Colloquium on Automata, Languages and Programming, ICALP 2004, pages 568-580, 2004.
37. F. Gavril. The intersection graphs of subtrees in trees are exactly the chordal graphs. J. Comb. Theory Series B, 16:47-56, 1974.
38. V. Gogate and R. Dechter. A complete anytime algorithm for treewidth. In Proceedings of the 20th Annual Conference on Uncertainty in Artificial Intelligence UAI-04, pages 201-208, Arlington, Virginia, USA, 2004. AUAI Press.
39. M. C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, 1980.
40. 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, Lecture Notes in Computer Science, vol. 657.
41. G. Kirchhoff. Über die Auflösung der Gleichugen, auf welche man bei der Untersuchung der linearen Verteilung galvanischer Ströme geführt wird. Ann. Phys. Chem., 71:497-508, 1847.
42. A. M. C. A. Koster. Frequency Assignment - Models and Algorithms. PhD thesis, Univ. Maastricht, Maastricht, The Netherlands, 1999.
43. A. M. C. A. Koster, H. L. Bodlaender, and S. P. M. van Hoesel. Treewidth: Computational experiments. In H. Broersma, U. Faigle, J. Hurink, and S. Pickl, editors, Electronic Notes in Discrete Mathematics, volume 8, pages 54-57. Elsevier Science Publishers, 2001.
44. A. M. C. A. Koster, B. Marchal, and C. P. M. van Hoesel. Local search algorithms for treewidth. Work in progress, 2006.
45. A. M. C. A. Koster, S. P. M. van Hoesel, and A. W. J. Kolen. Solving partial constraint satisfaction problems with tree decomposition. Networks, 40(3): 170-180, 2002.
46. A. M. C. A. Koster, T. Wolle, and H. L. Bodlaender. Degree-based treewidth lower bounds. In S. E. Nikoletseas, editor, Proceedings of the 4th International Workshop on Experimental and Efficient Algorithms WEA 2005, pages 101-112. Springer Verlag, Lecture Notes in Computer Science, vol. 3503, 2005.
47. S. J. Lauritzen and D. J. Spiegelhalter. Local computations with probabilities on graphical structures and their application to expert systems. The Journal of the Royal Statistical Society. Series B (Methodological), 50:157-224, 1988.
48. C. Lautemann. Decomposition trees: structured graph representation and efficient algorithms. In Proceedings CAAP'88, pages 28-39. Springer Verlag, Lecture Notes in Computer Science, vol. 299, 1988.
49. T. Lengauer and E. Wanke. Efficient analysis of graph properties on context-free graph languages. In Proceedings of the 15th International Colloquium on Automata, Languages and Programming, ICALP'88, pages 379-393. Springer Verlag, Lecture Notes in Computer Science, vol. 317, 1988.
50. B. Lucena. A new lower bound for tree-width using maximum cardinality search. SIAM J. Disc. Math., 16:345-353, 2003.
51. J. Matoušek and R. Thomas. Algorithms for finding tree-decompositions of graphs. J. Algorithms, 12:1-22, 1991.
52. S. Ramachandramurthi. A lower bound for treewidth and its consequences. In E. W. Mayr, G. Schmidt, and G. Tinhofer, editors, Proceedings 20th International Workshop on Graph Theoretic Concepts in Computer Science WG'94, pages 14-25. Springer Verlag, Lecture Notes in Computer Science, vol. 903, 1995.
53. S. Ramachandramurthi. The structure and number of obstructions to treewidth. SIAM J. Disc. Math., 10:146-157, 1997.
54. B. A. Reed. Tree width and tangles, a new measure of connectivity and some applications, volume 241 of LMS Lecture Note Series, pages 87-162. Cambridge University Press, Cambridge, UK, 1997.
55. B. A. Reed. Algorithmic aspects of tree width, pages 85-107. CMS Books Math. / Ouvrages Math. SMC, 11. Springer, New York, 2003.
56. N. Robertson and P. D. Seymour. Graph minors. II. Algorithmic aspects of tree-width. J. Algorithms, 7:309-322, 1986.
57. H. Röhrig. Tree decomposition: A feasibility study. Master's thesis, Max-Planck-Institut für Informatik, Saarbrücken, Germany, 1998.
58. D. J. Rose, R. E. Tarjan, and G. S. Lueker. Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput., 5:266-283, 1976.
59. P. D. Seymour and R. Thomas. Graph searching and a minimax theorem for tree-width. J. Comb. Theory Series B, 58:239-257, 1993.
60. K. Shoikhet and D. Geiger. A practical algorithm for finding optimal triangulations. In Proc. National Conference on Artificial Intelligence (AAAI '97), pages 185-190. Morgan Kaufmann, 1997.
61. M. M. Syslo. NP-complete problems on some tree-structured graphs: A review. In M. Nagl and J. Perl, editors, Proc. WG'83 International Workshop on Graph Theoretic Concepts in Computer Science, pages 342-353, Linz, West Germany, 1983. University Verlag Rudolf Trauner.
62. R. E. Tarjan and M. Yannakakis. Simple linear time algorithms to test chordiality of graphs, test acyclicity of graphs, and selectively reduce acyclic hypergraphs. SIAM J. Comput., 13:566-579, 1984.
63. J. A. Telle and A. Proskurowski. Algorithms for vertex partitioning problems on partial k-trees. SIAM J. Disc. Math., 10:529-550, 1997.
64. T. V. Wimer. Linear Algorithms on k-Terminal Graphs. PhD thesis, Dept. of Computer Science, Clemson University, 1987.
65. T. V. Wimer, S. T. Hedetniemi, and R. Laskar. A methodology for constructing linear graph algorithms. Congressus Numerantium, 50:43-60, 1985.
66. X. Zhou, K. Fuse, and T. Nishizeki. A linear algorithm for finding [g, f]-colorings of partial k-trees. Algorithmica, 27:227-243, 2000.