Discovering treewidth

Lecture Notes in Computer Science

Volumn 3381, Issue , 2005, Pages 1-16

  Bodlaender, Hans L ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; PARAMETER ESTIMATION;

BOUNDS; TREE DECOMPOSITION; TREEWIDTH;

COMPUTER SCIENCE;

EID: 24144488303     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30577-4_1     Document Type: Conference Paper

References (91)

1. J. Alber, F. Dorn, and R. Niedermeier. Experimental evaluation of a tree decomposition based algorithm for vertex cover on planar graphs. To appear in Discrete Applied Mathematics, 2004.
2. E. Amir. Efficient approximations for triangulation of minimum treewidth. In Proc. 17th Conference on Uncertainty in Artificial Intelligence, pages 7-15, 2001.
3. S. Arnborg, D. G. Corneil, and A. Proskurowski. Complexity of finding embeddings in a k-tree. SIAM J. Alg. Disc. Meth., 8:277-284, 1987.
4. S. Arnborg and A. Proskurowski. Characterization and recognition of partial 3-trees. SIAM J. Alg. Disc. Meth., 7:305-314, 1986.
5. E. Bachoore and H. L. Bodlaender. New upper bound heuristics for treewidth. Technical Report UU-CS-2004-036, Institute for Information and Computing Sciences, Utrecht University, Utrecht, the Netherlands, 2004.
6. A. Becker and D. Geiger. A sufficiently fast algorithm for finding close to optimal clique trees. Artificial Intelligence, 125:3-17, 2001.
7. A. Berry, J. Blair, P. Heggernes, and B. Peyton. Maximum cardinality search for computing minimal triangulations of graphs. Algorithmica, 39:287-298, 2004.
8. J. R. S. Blair, P. Heggernes, and J. Telle. A practical algorithm for making filled graphs minimal. Theor. Comp. Sc., 250:125-141, 2001.
9. H. L. Bodlaender. A tourist guide through treewidth. Acta Cybernetica, 11:1-23, 1993.
10. H. L. Bodlaender. Improved self-reduction algorithms for graphs with bounded treewidth. Disc. Appl. Math., 54:101-115, 1994.
11. H. L. Bodlaender. A linear time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput., 25:1305-1317, 1996.
12. H. L. Bodlaender. A partial k-arboretum of graphs with bounded treewidth. Theor. Comp. Sc., 209:1-45, 1998.
13. H. L. Bodlaender, J. R. Gilbert, H. Hafsteinsson, and T. Kloks. Approximating treewidth, pathwidth, frontsize, and minimum elimination tree height. J. Algorithms, 18:238-255, 1995.
14. H. L. Bodlaender and T. Hagerup. Parallel algorithms with optimal speedup for bounded treewidth. SIAM J. Comput., 27:1725-1746, 1998.
15. H. L. Bodlaender and T. Kloks. Efficient and constructive algorithms for the pathwidth and treewidth of graphs. J. Algorithms, 21:358-402, 1996.
16. H. L. Bodlaender, T. Kloks, D. Kratsch, and H. Mueller. Treewidth and minimum fill-in on d-trapezoid graphs. J. Graph Algorithms and Applications, 2(5): 1-23, 1998.
17. H. L. Bodlaender and A. M. C. A. Koster. On the maximum cardinality search lower bound for treewidth, 2004. Extended abstract to appear in proceedings WG 2004.
18. H. L. Bodlaender and A. M. C. A. Koster. Safe separators for treewidth. In Proceedings 6th Workshop on Algorithm Engineering and Experiments ALENEX04, pages 70-78, 2004.
19. H. L. Bodlaender, A. M. C. A. Koster, F. van den Eijkhof, and L. C. van der Gaag. Pre-processing for triangulation of probabilistic networks. In J. Breese and D. Koller, editors, Proceedings of the 17th Conference on Uncertainty in Artificial Intelligence, pages 32-39, San Francisco, 2001. Morgan Kaufmann.
20. 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.
21. H. L. Bodlaender, A. M. C. A. Koster, and T. Wolle. Degree-based treewidth lower bounds. Paper in preparation, 2004.
22. H. L. Bodlaender and R. H. Möhring. The pathwidth and treewidth of cographs. SIAM J. Disc. Math., 6:181-188, 1993.
23. H. L. Bodlaender and U. Roties. Computing the treewidth and the minimum fill-in with the modular decomposition. Algorithmica, 36:375-408, 2003.
24. H. L. Bodlaender and D. M. Thilikos. Treewidth for graphs with small chordality. Disc. Appl. Math., 79:45-61, 1997.
25. H. L. Bodlaender and B. van Antwerpen-de Fluiter. Parallel algorithms for series parallel graphs and graphs with treewidth two. Algorithmica, 29:543-559, 2001.
26. H. L. Bodlaender and T. Wolle. Contraction degeneracy on cographs. Technical Report UU-CS-2004-031, Institute for Information and Computing Sciences, Utrecht University, Utrecht, the Netherlands, 2004.
27. V. Bouchitté, D. Kratsch, H. Müller, and I. Todinca. On treewidth approximations. Disc. Appl. Math., 136:183-196, 2004.
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. V. Bouchitté and I. Todinca. Approximating the treewidth of at-free graphs. Disc. Appl. Math., 131:11-37, 2003.
31. H. Broersma, E. Dahlhaus, and T. Kloks. A linear time algorithm for minimum fill in and tree width for distance hereditary graphs. Disc. Appl. Math., 99:367-400, 2000.
32. H. Broersma, T. Kloks, D. Kratsch, and H. Müller. A generalization of AT-free graphs and a generic algorithm for solving triangulation problems. Algorithmica, 32:594-610, 2002.
33. F. Clautiaux, S. N. A. Moukrim, and J. Carlier. Heuristic and meta-heuristic methods for computing graph treewidth. RAIRO Oper. Res., 38:13-26, 2004.
34. 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 Workshop on Experimental and Efficient Algorithms, WEA 2003, pages 70-80. Springer Verlag, Lecture Notes in Computer Science, vol. 2647, 2003.
35. W. Cook and P. D. Seymour. Tour merging via branch-decomposition. Informs J. on Computing, 15(3):233-248, 2003.
36. B. Courcelle, J. A. Makowsky, and U. Roties. Linear time solvable optimization problems on graphs of bounded clique width. Theor. Comp. Sc., 33:125-150, 2000.
37. E. Dahlhaus. Minimal elimination ordering inside a given chordal graph. In Proceedings 23rd International Workshop on Graph-Theoretic Concepts in Computer Science WG'97, pages 132-143. Springer Verlag, Lecture Notes in Computer Science, vol. 1335, 1997.
38. E. Dahlhaus. Minimum fill-in and treewidth for graphs modularly decomposable into chordal graphs. In Proceedings 24th International Workshop on GraphTheoretic Concepts in Computer Science WG'98, pages 351-358. Springer Verlag, Lecture Notes in Computer Science, vol. 1517, 1998.
39. R. Dechter. Bucket elimination: a unifying framework for reasoning. Acta Informatica, 113:41-85, 1999.
40. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer, 1998.
41. 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, pages 568-580, 2004.
42. F. Gavril. The intersection graphs of subtrees in trees are exactly the chordal graphs. J. Comb. Theory Series B, 16:47-56, 1974.
43. V. Gogate and R. Dechter. A complete anytime algorithm for treewidth. In proceedings UAI'04, Uncertainty in Artificial Intelligence, 2004.
44. M. C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, 1980.
45. J. Gustedt, O. A. Maehle, and J. A. Telle. The treewidth of Java programs. In D. M. Mount and C. Stein, editors, Proceedings 4th International Workshop on Algorithm Engineering and Experiments, pages 86-97. Springer Verlag, Lecture Notes in Computer Science, vol. 2409, 2002.
46. M. Habib and R. H. Möhring. Treewidth of cocomparability graphs and a new order-theoretic parameter. ORDER, 1:47-60, 1994.
47. 2.376). To appear in proceedings SODA'05, 2005.
48. P. Heggernes and Y. Villanger. Efficient implementation of a minimal triangulation algorithm. In R. Möhring and R. Raman, editors, Proceedings of the 10th Annual European Symposium on Algorithms, ESA'2002, pages 550-561. Springer Verlag, Lecture Notes in Computer Science, vol. 2461, 2002.
49. M. Held and R. Karp. A dynamic programming approach to sequencing problems. J. SIAM, 10:196-210, 1962.
50. I. V. Hicks. Graphs, branchwidth, and tangles! Oh my! Working paper, http://ie.tamu.edu/People/faculty/Hicks/default.htm.
51. I. V. Hicks. Planar branch decompositions I: The ratcatcher. INFORMS Journal on Computing (to appear).
52. I. V. Hicks. Planar branch decompositions II: The cycle method. INFORMS Journal on Computing (to appear).
53. I. V. Hicks. Branch Decompositions and their Applications. Ph. d. thesis, Rice University, Houston, Texas, 2000.
54. I. V. Hicks. Branchwidth heuristics. Congressus Numerantium, 159:31-50, 2002.
55. I. V. Hicks. Branch decompositions and minor containment. Networks, 43:1-9, 2004.
56. U. Kjaerulff. Optimal decomposition of probabilistic networks by simulated annealing. Statistics and Computing, 2:2-17, 1992.
57. T. Kloks. Treewidth. Computations and Approximations. Lecture Notes in Computer Science, Vol. 842. Springer-Verlag, Berlin, 1994.
58. T. Kloks. Treewidth of circle graphs. Int. J. Found. Computer Science, 7:111-120, 1996.
59. T. Kloks and D. Kratsch. Treewidth of chordal bipartite graphs. J. Algorithms, 19:266-281, 1995.
60. T. Kloks, D. Kratsch, and J. Spinrad. On treewidth and minimum fill-in of asteroidal triple-free graphs. Theor. Comp. Sc., 175:309-335, 1997.
61. A. M. C. A. Koster. Frequency Assignment - Models and Algorithms. PhD thesis, Univ. Maastricht, Maastricht, the Netherlands, 1999.
62. 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. Elsevier Science Publishers, 2001.
63. 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:170-180, 2002.
64. J. Lagergren. Efficient parallel algorithms for graphs of bounded tree-width. J. Algorithms, 20:20-44, 1996.
65. J. Lagergren and S. Arnborg. Finding minimal forbidden minors using a finite congruence. In Proceedings of the 18th International Colloquium on Automata, Languages and Programming, pages 532-543. Springer Verlag, Lecture Notes in Computer Science, vol. 510, 1991.
66. P. Larrañaga, C. M. H. Kuijpers, M. Poza, and R. H. Murga. Decomposing Bayesian networks: triangulation of the moral graph with genetic algorithms. Statistics and Computing (UK), 7(l):19-34, 1997.
67. 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.
68. D. R. Lick and A. T. White, k-degenerate graphs. Canadian Journal of Mathematics, 22:1082-1096, 1970.
69. B. Lucena. A new lower bound for tree-width using maximum cardinality search. SIAM J. Disc. Math., 16:345-353, 2003.
70. J. Matoušek and R. Thomas. Algorithms for finding tree-decompositions of graphs. J. Algorithms, 12:1-22, 1991.
71. K. G. Olesen and A. L. Madsen. Maximal prime subgraph decomposition of Bayesian networks. IEEE Trans. on Systems, Man, and Cybernetics, Part B, 32:21-31, 2002.
72. A. Parra and P. Scheffler. Characterizations and algorithmic applications of chordal graph embeddings. Disc. Appl. Math., 79:171-188, 1997.
73. L. Perković and B. Reed. An improved algorithm for finding tree decompositions of small width. In P. Widmayer, editor, Proceedings 25th Int. Workshop on Graph Theoretic Concepts in Computer Science, WG'99, pages 148-154. Springer Verlag, Lecture Notes in Computer Science, vol. 1665, 1999.
74. S. Ramachandramurthi. A lower bound for tree width 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.
75. S. Ramachandramurthi. The structure and number of obstructions to treewidth. SIAM J. Disc. Math., 10:146-157, 1997.
76. B. Reed. Finding approximate separators and computing tree-width quickly. In Proceedings of the 24th Annual Symposium on Theory of Computing, pages 221-228, New York, 1992. ACM Press.
77. N. Robertson and P. D. Seymour. Graph minors. II. Algorithmic aspects of treewidth. J. Algorithms, 7:309-322, 1986.
78. N. Robertson and P. D. Seymour. Graph minors. XIII. The disjoint paths problem. J. Comb. Theory Series B, 63:65-110, 1995.
79. H. Röhrig. Tree decomposition: A feasibility study. Master's thesis, Max-Planck-Institut für Informatik, Saarbrücken, Germany, 1998.
80. D. J. Rose, R. E. Tarjan, and G. S. Lueker. Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput., 5:266-283, 1976.
81. D. P. Sanders. On linear recognition of tree-width at most four. SIAM J. Disc. Math., 9(1):101-117, 1996.
82. P. D. Seymour and R. Thomas. Call routing and the ratcatcher. Combinatorica, 14(2):217-241, 1994.
83. 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.
84. G. Szekeres and H. S. Wilf. An inequality for the chromatic number of a graph. J. Comb. Theory, 4:1-3, 1968.
85. 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.
86. M. Thorup. Structured programs have small tree-width and good register allocation. Information and Computation, 142:159-181, 1998.
87. Treewidthlib. http://www.cs.uu.nl/people/hansb/treewidthlib, 2004-03-31.
88. J. Valdes, R. E. Tarjan, and E. L. Lawler. The recognition of series parallel digraphs. SIAM J. Comput., 11:298-313, 1982.
89. F. van den Eijkhof and H. L. Bodlaender. Safe reduction rules for weighted treewidth. In L. Kučera, editor, Proceedings 28th Int. Workshop on Graph Theoretic Concepts in Computer Science, WG'02, pages 176-185. Springer Verlag, Lecture Notes in Computer Science, vol. 2573, 2002.
90. G. J. Woeginger. Exact algorithms for NP-hard problems: A survey. In Combinatorial Optimization: "Eureka, you shrink", pages 185-207, Berlin, 2003. Springer Lecture Notes in Computer Science, vol. 2570.
91. A. Yamaguchi, K. F. Aoki, and H. Mamitsuka. Graph complexity of chemical compounds in biological pathways. Genome Informatics, 14:376-377, 2003.