Contraction and treewidth lower bounds

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

Volumn 3221, Issue , 2004, Pages 628-639

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

^a UTRECHT UNIVERSITY   (Netherlands)

^b ZUSE INSTITUTE BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

CARDINALITIES; EDGE CONTRACTIONS; LOWER BOUNDS; MINIMUM DEGREE; POLYNOMIAL-TIME; SUBGRAPHS; TREE-WIDTH; TREEWIDTH LOWER BOUNDS;

POLYNOMIAL APPROXIMATION;

EID: 35048828795     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30140-0_56     Document Type: Article

References (19)

1. H. L. Bodlaender. A linear time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput., 25:1305-1317, 1996.
2. H. L. Bodlaender. A partial k-arboretum of graphs with bounded treewidth. Theor. Comp. Sc., 209:1-45, 1998.
3. 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.
4. 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.
5. B. Courcelle. The monadic second-order logic of graphs I: Recognizable sets of finite graphs. Information and Computation, 85:12-75, 1990.
6. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer, 1998.
7. V. Gogate and R. Dechter. A complete anytime algorithm for treewidth. To appear in proceedings UAI'04, Uncertainty in Artificial Intelligence, 2004.
8. A. M. C. A. Koster. Frequency assignment - Models and Algorithms. PhD thesis, Univ. Maastricht, Maastricht, the Netherlands, 1999.
9. 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.
10. 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.
11. 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.
12. B. Lucena. A new lower bound for tree-width using maximum cardinality search. SIAM J. Disc. Math., 16:345-353, 2003.
13. 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.
14. S. Ramachandramurthi. The structure and number of obstructions to treewidth. SIAM J. Disc. Math., 10:146-157, 1997.
15. N. Robertson and P. D. Seymour. Graph minors. XX. Wagner's conjecture. To appear.
16. N. Robertson and P. D. Seymour. Graph minors. XIII. The disjoint paths problem. J. Comb. Theory Series B, 63:65-110, 1995.
17. N. Robertson, P. D. Seymour, and R. Thomas. Quickly excluding a planar graph. J. Comb. Theory Series B, 62:323-348, 1994.
18. 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.
19. Treewidthlib. http://www.cs.uu.nl/people/hansb/treewidthlib, 2004-03-31.