Abstract
In this paper we present a new technique for computing lower bounds for graph treewidth. Our technique is based on the fact that the treewidth of a graph G is the maximum order of a bramble of G minus one. 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 both the treewidth and branchwidth that is at most a constant factor away from the optimum. For both algorithms, we report on extensive computational experiments that show that the algorithms often give excellent lower bounds, in particular when applied to (close to) planar graphs.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, New York (1993)
Amir, E.: Efficient approximations for triangulation of minimum treewidth. In: Proceedings of the 17th Conference on Uncertainty in Artificial Intelligence, pp. 7–15, 2001
Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of finding embeddings in a k-tree. SIAM J. Algebr. Discrete Methods 8, 277–284 (1987)
Bellenbaum, P., Diestel, R.: Two short proofs concerning tree-decompositions. Comb. Probab. Comput. 11, 541–547 (2002)
Bodlaender, H.L.: A linear time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25, 1305–1317 (1996)
Bodlaender, H.L.: A partial k-arboretum of graphs with bounded treewidth. Theor. Comput. Sci. 209, 1–45 (1998)
Bodlaender, H.L.: Discovering treewidth. In: Vojtás̆, P., Bieliková, M., Charron-Bost, B. (eds.) SOFSEM 2005: Theory and Practive of Computer Science: 31st Conference on Current Trends in Theory and Practive of Computer Science. Lecture Notes in Computer Science, vol. 3381, pp. 1–16. Springer, Berlin (2005)
Bodlaender, H.L., Koster, A.M.C.A.: On the Maximum Cardinality Search lower bound for treewidth. In: Hromkovic̆, J., Nagl, M., Westfechtel, B. (eds.) Proc. 30th International Workshop on Graph-Theoretic Concepts in Computer Science WG 2004. Lecture Notes in Computer Science, vol. 3353, pp. 81–92. Springer, Berlin (2004)
Bodlaender, H.L., Koster, A.M.C.A.: Safe separators for treewidth. Discrete Math. 306, 337–350 (2006)
Bodlaender, H.L., Koster, A.M.C.A., Wolle, T.: Contraction and treewidth lower bounds. In: Albers, S., Radzik, T. (eds.) Proceedings 12th Annual European Symposium on Algorithms, ESA2004. Lecture Notes in Computer Science, vol. 3221, pp. 628–639. Springer, Berlin (2004)
Bodlaender, H.L., Koster, A.M.C.A., Eijkhof, F.v.d: Pre-processing rules for triangulation of probabilistic networks. Comput. Intell. 21(3), 286–305 (2005)
Bodlaender, H.L., Koster, A.M.C.A., Wolle, T.: Contraction and treewidth lower bounds. J. Graph Algorithms Appl. 10(1), 5–49 (2006)
Bouchitté, V., Todinca, I.: Treewidth and minimum fill-in: Grouping the minimal separators. SIAM J. Comput. 31, 212–232 (2001)
Clautiaux, F., Carlier, J., Moukrim, A., Négre, S.: New lower and upper bounds for graph treewidth. In: Rolim, J.D.P. (ed.) Proceedings International Workshop on Experimental and Efficient Algorithms, WEA 2003. Lecture Notes in Computer Science, vol. 2647, pp. 70–80. Springer, Berlin (2003)
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)
Cook, W., Seymour, P.D.: Tour merging via branch-decomposition. INFORMS J. Comput. 15(3), 233–248 (2003)
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, SODA2005, pp. 682–689, 2005
Díaz, J., Petit, J., Serna, M.: A survey of graph layout problems. ACM Comput. Surv. 34, 313–356 (2002)
Diestel, R., Jensen, T.R., Gorbunov, K.Y., Thomassen, C.: Highly connected sets and the excluded grid theorem. J. Comb. Theory Ser. B 75, 61–73 (1999)
Fomin, F.V., Kratsch, D., Todinca, I.: Exact (exponential) algorithms for treewidth and minimum fill-in. In: Proceedings of the 31st International Colloquium on Automata, Languages and Programming, pp. 568–580, 2004
Garey, M.R., Johnson, D.S.: Computers and Intractability, A Guide to the Theory of NP-Completeness. Freeman, New York (1979)
Gogate, V., Dechter, R.: A complete anytime algorithm for treewidth. In: Proceedings of the 20th Annual Conference on Uncertainty in Artificial Intelligence UAI-04, pp. 201–208, Arlington, Virginia, USA. AUAI Press (2004)
Gu, Q.-P., Tamaki, H.: Optimal branch-decomposition of planar graphs in O(n 3) time. In: Proceedings of the 32nd International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science. Springer, Berlin (2005)
Hicks, I.V.: Planar branch decompositions I: the Ratcatcher. INFORMS J. Comput. 17, 402–412 (2005)
Hicks, I.V.: Planar branch decompositions II: the cycle method. INFORMS J. Comput. 17, 413–421 (2005)
Hopcroft, J.E., Tarjan, R.E.: Efficient planarity testing. J. ACM 21, 549–568 (1974)
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, pp. 54–57. Elsevier, Amsterdam (2001)
Koster, A.M.C.A., Wolle, T., Bodlaender, H.L.: Degree-based treewidth lower bounds. In: Nikoletseas, S.E. (ed.) Proceedings of the 4th International Workshop on Experimental and Efficient Algorithms WEA 2005. Lecture Notes in Computer Science, vol. 3503, pp. 101–112. Springer, Berlin (2005)
Lucena, B.: A new lower bound for tree-width using maximum cardinality search. SIAM J. Discrete Math. 16, 345–353 (2003)
Menger, K.: Zur allgemeinen Kurventheorie. Fund. Math. 10, 96–115 (1927)
Ramachandramurthi, S.: The structure and number of obstructions to treewidth. SIAM J. Discrete Math. 10, 146–157 (1997)
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)
Robertson, N., Seymour, P.D.: Graph minors. II. Algorithmic aspects of tree-width. J. Algorithms 7, 309–322 (1986)
Robertson, N., Seymour, P.D.: Graph minors. X. Obstructions to tree-decomposition. J. Comb. Theory Ser. B 52, 153–190 (1991)
Robertson, N., Seymour, P.D.: Graph minors. XIII. The disjoint paths problem. J. Comb. Theory Ser. B 63, 65–110 (1995)
Robertson, N., Seymour, P.D., Thomas, R.: Quickly excluding a planar graph. J. Comb. Theory Ser. B 62, 323–348 (1994)
Seymour, P.D., Thomas, R.: Graph searching and a minimax theorem for tree-width. J. Comb. Theory Ser. B 58, 239–257 (1993)
Seymour, P.D., Thomas, R.: Call routing and the Ratcatcher. Combinatorica 14(2), 217–241 (1994)
Treewidthlib, http://www.cs.uu.nl/people/hansb/treewidthlib (2004)
West, D.B.: Introduction to Graph Theory. Prentice Hall, New York (2001)
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)
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Prof. Dr. Susanne Albers.
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).
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License ( https://creativecommons.org/licenses/by-nc/2.0 ), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Bodlaender, H.L., Grigoriev, A. & Koster, A.M.C.A. Treewidth Lower Bounds with Brambles. Algorithmica 51, 81–98 (2008). https://doi.org/10.1007/s00453-007-9056-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-007-9056-z