Skip to main content
SpringerLink
Log in

Treewidth

  • Chapter
  • First Online:
Exact Exponential Algorithms

Part of the book series: Texts in Theoretical Computer Science. An EATCS Series ((TTCS))

Abstract

The treewidth of a graph is one of the most fundamental notions in graph theory and graph algorithms. In this chapter, we give several applications of treewidth in exact algorithms.We also provide an exact algorithm computing the treewidth of a graph.

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

Access this chapter

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 84.99
Price excludes VAT (USA)
  • Durable hardcover 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Robertson, N., Seymour, P.D.: Graph minors. II. Algorithmic aspects of tree-width. Journal of Algorithms 7(3), 309–322 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  2. Kloks, T.: Treewidth, Computations and Approximations, Lecture Notes in Comput. Sci., vol. 842. Springer (1994)

    Google Scholar 

  3. Seymour, P.D., Thomas, R.: Graph searching and a min-max theorem for tree-width. J. Combin. Theory Ser. B 58(1), 22–33 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  4. Berry, A., Bordat, J.P., Cogis, O.: Generating all the minimal separators of a graph. Int. J. Found. Comput. Sci. 11 (3), 397–403 (2000)

    Article  MathSciNet  Google Scholar 

  5. Halin, R.: S-functions for graphs. J. Geometry 8(1-2), 171–186 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  6. Robertson, N., Seymour, P.D.: Graph minors. III. Planar tree-width. J. Combin. Theory Ser. B 36, 49–64 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  7. Robertson, N., Seymour, P.D.: Graph minors. V. Excluding a planar graph. J. Combin. Theory Ser. B 41(1), 92–114 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  8. Arnborg, S., Proskurowski, A.: Linear time algorithms for NP-hard problems restricted to partial k-trees. Disc. Appl. Math. 23(1), 11–24 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  9. Courcelle, B.: The monadic second-order logic of graphs I: Recognizable sets of finite graphs. Information and Computation 85, 12–75 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  10. Courcelle, B.: The monadic second-order logic of graphs III: Treewidth, forbidden minors and complexity issues. Informatique Théorique 26, 257–286 (1992)

    MATH  MathSciNet  Google Scholar 

  11. Ellis, J.A., Sudborough, I.H., Turner, J.S.: The vertex separation and search number of a graph. Information and Computation 113(1), 50–79 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  12. Petrov, N.N.: Some extremal search problems on graphs. Differentsial’nye Uravneniya 18(5), 821–827 (1982)

    MATH  Google Scholar 

  13. Parsons, T.D.: Pursuit-evasion in a graph. In: Theory and applications of graphs, Lecture Notes in Math., vol. 642, pp. 426–441. Springer, Berlin (1978)

    Google Scholar 

  14. Monien, B., Preis, R.: Upper bounds on the bisection width of 3- and 4-regular graphs. J. Discrete Algorithms 4(3), 475–498 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  15. Bezrukov, S., Elsässer, R., Monien, B., Preis, R., Tillich, J.P.: New spectral lower bounds on the bisection width of graphs. Theor. Comp. Sci. 320(2-3), 155–174 (2004)

    Article  MATH  Google Scholar 

  16. Fomin, F.V., Gaspers, S., Saurabh, S., Stepanov, A.A.: On two techniques of combining branching and treewidth. Algorithmica 54(2), 181–207 (2009)

    Article  MathSciNet  Google Scholar 

  17. Díaz, J., Serna, M., Thilikos, D.M.: Counting H-colorings of partial k-trees. Theor. Comput. Sci. 281, 291–309 (2002)

    Article  MATH  Google Scholar 

  18. Kneis, J., Mölle, D., Richter, S., Rossmanith, P.: A bound on the pathwidth of sparse graphs with applications to exact algorithms. SIAM J. Discrete Math. 23(1), 407–427 (2009).

    Article  MATH  Google Scholar 

  19. Babai, L., Kantor, W.M., Luks, E.M.: Computational complexity and the classification of finite simple groups. In: Proceedings of the 24th Annual Symposium on Foundations of Computer Science (FOCS 1983), pp. 162–171. IEEE (1983)

    Google Scholar 

  20. Bouchitté, V., Todinca, I.: Listing all potential maximal cliques of a graph. Theor. Comput. Sci. 276(1-2), 17–32 (2002)

    Article  MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  22. Fomin, F.V., Villanger, Y.: Treewidth computation and extremal combinatorics. In: Proceedings of the 34th International Colloquium on Automata, Languages and Programming (ICALP 2008), Lecture Notes in Comput. Sci., vol. 5125, pp. 210–221. Springer (2008)

    Google Scholar 

  23. Fomin, F.V., Villanger, Y.: Finding induced subgraphs via minimal triangulations. In: Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science (STACS 2010), Leibniz International Proceedings in Informatics, vol. 5, pp. 383–394. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik (2010)

    Google Scholar 

  24. Bodlaender, H.L., Fomin, F.V., Koster, A.M.C.A., Kratsch, D., Thilikos, D.M.: On exact algorithms for treewidth. In: Proceedings of the 14th Annual European Symposium on Algorithms (ESA 2006), Lecture Notes in Comput. Sci., vol. 4168, pp. 672–683. Springer (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Bergen, Inst. Informatics, PO Box 7800, 5020, Bergen, Norway

    Prof. Dr. Fedor V. Fomin

  2. Dépt. Informatique Ile du Saulcy, Université Paul Verlaine - Metz, LITA, UFR MIM, 57045, Cedex 1, France

    Prof. Dieter Kratsch

Authors
  1. Prof. Dr. Fedor V. Fomin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Prof. Dieter Kratsch
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Fedor V. Fomin .

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Fomin, F.V., Kratsch, D. (2010). Treewidth. In: Exact Exponential Algorithms. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16533-7_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-16533-7_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-16532-0

  • Online ISBN: 978-3-642-16533-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation