Skip to main content
SpringerLink
Log in
Book cover

European Symposium on Algorithms

ESA 2005: Algorithms – ESA 2005 pp 391–402Cite as

Treewidth Lower Bounds with Brambles

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3669))

Abstract

In this paper we present a new technique for computing lower bounds for graph treewidth. Our technique is based on the characterisation of the treewidth as the maximum order of a bramble of the graph. We give two algorithms: one for general graphs, and one for planar graphs. The algorithm for planar graphs is shown to give a lower bound for the treewidth that is at most a constant factor away from the exact treewidth. For both algorithms, we report on extensive computational experiments that show that the algorithms give often excellent lower bounds, in particular when applied to (close to) planar graphs.

This work was partially supported by the Netherlands Organisation for Scientific Research NWO (project Treewidth and Combinatorial Optimisation) and partially by the DFG research group ”Algorithms, Structure, Randomness” (Grant number GR 883/9-3, GR 883/9-4).

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs (1993)

    Google Scholar 

  2. Amir, E.: Efficient approximations for triangulation of minimum treewidth. In: Proceedings of the 17th Conference on Uncertainty in Artificial Intelligence, pp. 7–15 (2001)

    Google Scholar 

  3. Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of finding embeddings in a k-tree. SIAM J. Alg. Disc. Meth. 8, 277–284 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  4. Bellenbaum, P., Diestel, R.: Two short proofs concerning tree-decompositions. Combinatorics, Probability, and Computing 11, 541–547 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  5. Bodlaender, H.L.: A linear time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25, 1305–1317 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  6. Bodlaender, H.L.: Discovering treewidth. In: Vojtáš, P., Bieliková, M., Charron-Bost, B., Sýkora, O. (eds.) SOFSEM 2005. LNCS, vol. 3381, pp. 1–16. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  7. Bodlaender, H.L., Koster, A.M.C.A.: On the Maximum Cardinality Search lower bound for treewidth. In: Hromkovič, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol. 3353, pp. 81–92. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  8. Bodlaender, H.L., Koster, A.M.C.A.: Safe separators for treewidth. In: Proceedings 6th Workshop on Algorithm Engineering and Experiments, ALENEX 2004, pp. 70–78 (2004)

    Google Scholar 

  9. Bodlaender, H.L., Koster, A.M.C.A., van de Eijkhof, F., van der Gaag, L.C.: Pre-processing for triangulation of probabilistic networks. In: Breese, J., Koller, D. (eds.) Proceedings of the 17th Conference on Uncertainty in Artificial Intelligence, pp. 32–39. Morgan Kaufmann, San Francisco (2001)

    Google Scholar 

  10. Bodlaender, H.L., Koster, A.M.C.A., Wolle, T.: Contraction and treewidth lower bounds. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol. 3221, pp. 628–639. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  11. Bouchitté, V., Todinca, I.: Treewidth and minimum fill-in: Grouping the minimal separators. SIAM J. Comput. 31, 212–232 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  12. Clautiaux, F., Carlier, J., Moukrim, A., Négre, S.: New lower and upper bounds for graph treewidth. In: Rolim, J.D.P. (ed.) WEA 2003. LNCS, vol. 2647, pp. 70–80. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  13. Clautiaux, F., Moukrim, A., Négre, S., Carlier, J.: Heuristic and meta-heuristic methods for computing graph treewidth. RAIRO Oper. Res. 38, 13–26 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  14. Cook, W., Seymour, P.D.: Tour merging via branch-decomposition. Informs J. on Computing 15(3), 233–248 (2003)

    Article  MathSciNet  Google Scholar 

  15. Demaine, E.D., Hajiaghayi, M.: Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, pp. 682–689 (2005)

    Google Scholar 

  16. Diestel, R., Jensen, T.R., Gorbunov, K.Y., Thomassen, C.: Highly connected sets and the excluded grid theorem. J. Comb. Theory Series B 75, 61–73 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  17. Fomin, F.V., Kratsch, D., Todinca, I.: Exact (exponential) algorithms for treewidth and minimum fill-in. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 568–580. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  18. Gogate, V., Dechter, R.: A complete anytime algorithm for treewidth. In: Proceedings of the 20th Annual Conference on Uncertainty in Artificial Intelligence UAI 2004, pp. 201–208. AUAI Press, Arlington (2004)

    Google Scholar 

  19. Hicks, I.V.: Planar branch decompositions I: The ratcatcher. INFORMS Journal on Computing (2005) (to appear)

    Google Scholar 

  20. Hicks, I.V.: Planar branch decompositions II: The cycle method. INFORMS Journal on Computing (2005) (to appear)

    Google Scholar 

  21. Koster, A.M.C.A., Bodlaender, H.L., van Hoesel, S.P.M.: Treewidth: Computational experiments. In: Broersma, H., Faigle, U., Hurink, J., Pickl, S. (eds.) Electronic Notes in Discrete Mathematics, vol. 8. Elsevier Science Publishers, Amsterdam (2001)

    Google Scholar 

  22. Koster, A.M.C.A., Wolle, T., Bodlaender, H.L.: Degree-based treewidth lower bounds. In: Nikoletseas, S.E. (ed.) WEA 2005. LNCS, vol. 3503, pp. 101–112. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  23. Lucena, B.: A new lower bound for tree-width using maximum cardinality search. SIAM J. Disc. Math. 16, 345–353 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  24. Ramachandramurthi, S.: The structure and number of obstructions to treewidth. SIAM J. Disc. Math. 10, 146–157 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  25. Reed, B.A.: Tree width and tangles, a new measure of connectivity and some applications. LMS Lecture Note Series, vol. 241, pp. 87–162. Cambridge University Press, Cambridge (1997)

    Google Scholar 

  26. Robertson, N., Seymour, P.D., Thomas, R.: Quickly excluding a planar graph. J. Comb. Theory Series B 62, 323–348 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  27. Seymour, P.D., Thomas, R.: Graph searching and a minimax theorem for tree-width. J. Comb. Theory Series B 58, 239–257 (1993)

    Article  MathSciNet  Google Scholar 

  28. Seymour, P.D., Thomas, R.: Call routing and the ratcatcher. Combinatorica 14(2), 217–241 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  29. West, D.B.: Introduction to graph theory. Prentice-Hall, Englewood Cliffs (2001)

    Google Scholar 

  30. Wolle, T., Koster, A.M.C.A., Bodlaender, H.L.: A note on contraction degeneracy. Technical Report UU-CS-2004-042, Institute of Information and Computing Sciences, Utrecht University, Utrecht, The Netherlands (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Information and Computing Sciences, Utrecht University, P.O. Box 80.089, 3508 TB, Utrecht, The Netherlands

    Hans L. Bodlaender

  2. Department of Quantitative Economy, University of Maastricht, P.O. Box 616, 6200 MD, Maastricht, The Netherlands

    Alexander Grigoriev

  3. Zuse Institute Berlin (ZIB), Takustraße 7, D-14195, Berlin-Dahlem, Germany

    Arie M. C. A. Koster

Authors
  1. Hans L. Bodlaender
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alexander Grigoriev
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Arie M. C. A. Koster
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. BRICS, MADALGO, Department of Computer Science, University of Aarhus, Denmark

    Gerth Stølting Brodal

  2. University of Rome “La Sapienza”, Rome, Italy

    Stefano Leonardi

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bodlaender, H.L., Grigoriev, A., Koster, A.M.C.A. (2005). Treewidth Lower Bounds with Brambles. In: Brodal, G.S., Leonardi, S. (eds) Algorithms – ESA 2005. ESA 2005. Lecture Notes in Computer Science, vol 3669. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11561071_36

Download citation

  • DOI: https://doi.org/10.1007/11561071_36

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29118-3

  • Online ISBN: 978-3-540-31951-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation