On the maximum cardinality search lower bound for treewidth

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

Volumn 3353, Issue , 2004, Pages 81-92

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

^a UTRECHT UNIVERSITY   (Netherlands)

^b ZUSE INSTITUTE BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; GRAPH THEORY; LEARNING ALGORITHMS; POLYNOMIAL APPROXIMATION;

CARDINALITIES; CONSTANT RATIO; GRAPH G; LOW BOUND; NP COMPLETE; PLANAR GRAPH; POLYNOMIAL TIME APPROXIMATION ALGORITHMS; SEARCH ALGORITHMS; TREE-WIDTH; UPPER AND LOWER BOUNDS; LOWER BOUNDS; REAL-LIFE APPLICATIONS;

POLYNOMIAL APPROXIMATION; GRAPH THEORY;

EID: 35048873216     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30559-0_7     Document Type: Article

References (15)

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 and A. M. G. A. Koster. Safe separators for treewidth. In Proceedings 6th Workshop on Algorithm Engineering and Experiments ALENEX04, pages 70-78, 2004.
3. 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.
4. H. L. Bodlaender, A. M. C. A. Koster, and T. Wolle. Contraction and treewidth lower bounds. Technical report UU-CS-2004-034, Institute of Information and Computing Sciences, Utrecht University, 2004. To appear in proceedings ESA 2004.
5. 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.
6. V. Gogate and R. Dechter. A complete anytime algorithm for treewidth. To appear in proceedings UAI'04, Uncertainty in Artificial Intelligence, 2004.
7. 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.
8. 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.
9. 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.
10. B. Lucena. A new lower bound for tree-width using maximum cardinality search. SIAM J. Disc. Math., 16:345-353, 2003.
11. S. Ramachandramurthi. The structure and number of obstructions to treewidth. SIAM J. Disc. Math., 10:146-157, 1997.
12. H. Röhrig. Tree decomposition: A feasibility study. Master's thesis, Max-Planck-Institut für Informatik, Saarbrucken, Germany, 1998.
13. G. Szekeres and H. S. Wilf. An inequality for the chromatic number of a graph. J. Comb. Theory, 4:1-3, 1968.
14. 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.
15. 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. 93-104