Treewidth computations II. Lower bounds

Information and Computation

Volumn 209, Issue 7, 2011, Pages 1103-1119

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

^a UTRECHT UNIVERSITY   (Netherlands)

^b RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

Graph algorithms; Heuristics; Lower bounds; Treewidth

Indexed keywords

BRANCH-AND-BOUND ALGORITHMS; GRAPH ALGORITHMS; HEURISTICS; LOWER BOUNDS; SPEED-UPS; TREE DECOMPOSITION; TREE-WIDTH;

ALGORITHMS; DYNAMIC PROGRAMMING; LINEAR PROGRAMMING;

TREES (MATHEMATICS);

EID: 79955111764     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2011.04.003     Document Type: Article

References (48)

1. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin Network Flows: Theory, Algorithms, and Applications 1993 Prentice Hall Upper Saddle River, NJ, USA
2. S. Arnborg Efficient algorithms for combinatorial problems on graphs with bounded decomposability - A survey BIT 25 1985 2 23 (Pubitemid 15513670)
3. S. Arnborg, and A. Proskurowski Characterization and recognition of partial 3-trees SIAM Journal on Algebraic and Discrete Methods 7 1986 305 314
4. P. Bellenbaum, and R. Diestel Two short proofs concerning tree-decompositions Combinatorics, Probability, and Computing 11 2002 541 547
5. H.L. Bodlaender A linear time algorithm for finding tree-decompositions of small treewidth SIAM Journal on Computing 25 1996 1305 1317 (Pubitemid 126584672)
6. H.L. Bodlaender A partial k-arboretum of graphs with bounded treewidth Theoretical Computer Science 209 1998 1 45 (Pubitemid 128450429)
7. H.L. Bodlaender Necessary edges in k-chordalizations of graphs Journal of Combinatorial Optimization 7 2003 283 290
8. H.L. Bodlaender, F.V. Fomin, A.M.C.A. Koster, D. Kratsch, and D.M. Thilikos On exact algorithms for treewidth Y. Azar, T. Erlebach, Proceedings of the 14th Annual European Symposium on Algorithms, ESA 2006 Lecture Notes in Computer Science vol. 4168 2006 Springer-Verlag 672 683 (Pubitemid 44699689)
9. H.L. Bodlaender, A. Grigoriev, and A.M.C.A. Koster Treewidth lower bounds with brambles Algorithmica 51 2008 81 98 (Pubitemid 351665412)
10. H.L. Bodlaender, T. Kloks, and D. Kratsch Treewidth and pathwidth of permutation graphs SIAM Journal on Discrete Mathematics 8 4 1995 606 616
11. H.L. Bodlaender, and A.M.C.A. Koster On the Maximum Cardinality Search lower bound for treewidth Discrete Applied Mathematics 155 11 2007 1348 1372 (Pubitemid 46899217)
12. H.L. Bodlaender, and A.M.C.A. Koster Treewidth computations I. Upper bounds Information and Computation 208 2010 259 275
13. H.L. Bodlaender, A.M.C.A. Koster, Treewidth computations III. Exact algorithms and preprocessing, in preparation.
14. 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 2005 286 305 (Pubitemid 41557451)
15. H.L. Bodlaender, T. Wolle, Contraction degeneracy on cographs, Technical Report UU-CS-2004-031, Institute for Information and Computing Sciences, Utrecht University, Utrecht, The Netherlands, 2004.
16. H.L. Bodlaender, T. Wolle, and A.M.C.A. Koster Contraction and treewidth lower bounds Journal of Graph Algorithms and Applications 10 2006 5 49
17. F. Clautiaux, J. Carlier, A. Moukrim, and S. Négre New lower and upper bounds for graph treewidth J.D.P. Rolim, Proceedings of the 2nd International Workshop on Experimental and Efficient Algorithms, WEA 2003 Lecture Notes in Computer Science vol. 2647 2003 Springer-Verlag 70 80
18. J. Cole Smith, E. Ulusal, and I.V. Hicks A combinatorial optimization algorithm for solving the branchwidth problem Technical Report, Rice University, 2010; URL: http://www.caam.rice.edu/~ivhicks/
19. R. Diestel Graph Theory 4th edition 2010 Springer-Verlag
20. The second DIMACS implementation challenge NP-hard problems: Maximum clique, graph coloring, and satisfiability see http://dimacs.rutgers.edu/ Challenges/ 1992/1993
21. V. Gogate, and R. Dechter A complete anytime algorithm for treewidth D.M. Chickering, J.Y. Halpern, Proceedings of the 20th Annual Conference on Uncertainty in Artificial Intelligence, UAI 2004 2004 AUAI Press 201 208
22. I.V. Hicks Planar branch decompositions I: The ratcatcher INFORMS Journal on Computing 17 2005 402 412 (Pubitemid 41673342)
23. I.V. Hicks, A.M.C.A. Koster, and E. Kolotoǧlu Branch and tree decomposition techniques for discrete optimization J.C. Smith, TutORials 2005 INFORMS Annual Meeting INFORMS Tutorials in Operations Research Series 2005 1 29 Chapter 1
24. A.M.C.A. Koster ComputeTW - An interactive platform for computing treewidth of graphs http://www.math2.rwth-aachen.de/~koster/ComputeTW 2009
25. A.M.C.A. Koster, T. Wolle, and H.L. Bodlaender Degree-based treewidth lower bounds S.E. Nikoletseas, Proceedings of the 4th International Workshop on Experimental and Efficient Algorithms, WEA 2005 Lecture Notes in Computer Science vol. 3503 2005 Springer-Verlag 101 112 (Pubitemid 41322438)
26. B. Lucena, Dynamic programming, tree-width, and computation on graphical models, PhD thesis, Brown University, Providence, RI, USA, 2002.
27. B. Lucena A new lower bound for tree-width using maximum cardinality search SIAM Journal on Discrete Mathematics 16 2003 345 353
28. I.L. Markov, and Y. Shi Constant-degree graph expansions that preserve treewidth Algorithmica 59 2011 461 470
29. S. Ramachandramurthi, Algorithms for VLSI layout based on graph width metrics, PhD thesis, Computer Science Department, University of Tennessee, Knoxville, Tennessee, USA, 1994.
30. S. Ramachandramurthi A lower bound for treewidth and its consequences E.W. Mayr, G. Schmidt, G. Tinhofer, Proceedings of the 20th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 94 Lecture Notes in Computer Science vol. 903 1995 Springer-Verlag 14 25
31. S. Ramachandramurthi The structure and number of obstructions to treewidth SIAM Journal on Discrete Mathematics 10 1997 146 157 (Pubitemid 127619999)
32. B.A. Reed Tree width and tangles, a new measure of connectivity and some applications Surveys in Combinatorics LMS Lecture Note Series vol. 241 1997 Cambridge University Press Cambridge, UK 87 162
33. N. Robertson, and P.D. Seymour Graph minors. II. Algorithmic aspects of tree-width Journal of Algorithms 7 1986 309 322
34. H. Röhrig, Tree decomposition: A feasibility study, Master s thesis, Max-Planck-Institut für Informatik, Saarbrücken, Germany, 1998.
35. A. Schrijver Combinatorial Optimization. Polyhedra and Efficiency 2003 Springer Berlin
36. P.D. Seymour, and R. Thomas Graph searching and a minimax theorem for tree-width Journal of Combinatorial Theory, Series B 58 1993 239 257
37. P.D. Seymour, and R. Thomas Call routing and the ratcatcher Combinatorica 14 2 1994 217 241
38. K. Shoikhet, and D. Geiger A practical algorithm for finding optimal triangulations Proceedings of the 15th National Conference on Artificial Intelligence, AAAI 97 1997 Morgan Kaufmann 185 190
39. J.G. Siek, L.-Q. Lee, and A. Lumsdaine The Boost Graph Library: User Guide and Reference Manual 2001 Addison-Wesley Professional Software available on http://www.boost.org
40. L. Sunil Chandran, and N. Sivadasan Boxicity and treewidth Journal of Combinatorial Theory, Series B 97 2007 733 744
41. L. Sunil Chandran, and C.R. Subramanian A spectral lower bound for the treewidth of a graph and its consequences Information Processing Letters 87 2003 195 200
42. L. Sunil Chandran, and C.R. Subramanian Girth and treewidth Journal of Combinatorial Theory, Series B 93 2005 23 32 (Pubitemid 39532640)
43. 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 Journal on Computing 13 1984 566 579 (Pubitemid 15514404)
44. TreewidthLIB http://www.cs.uu.nl/people/hansb/treewidthlib 2004
45. D.B. West Introduction to Graph Theory 2001 Prentice Hall
46. T. Wolle, Computational aspects of treewidth. Lower bounds and network reliability, PhD thesis, Faculty of Science, Utrecht University, Utrecht, the Netherlands, 2005.
47. T. Wolle, H.L. Bodlaender, A note on edge contraction, Technical Report UU-CS-2004-028, Institute of Information and Computing Sciences, Utrecht University, Utrecht, The Netherlands, 2004.
48. T. Wolle, A.M.C.A. Koster, H.L. Bodlaender, A note on contraction degeneracy, Technical Report UU-CS-2004-042, Institute of Information and Computing Sciences, Utrecht University, Utrecht, The Netherlands, 2004.