Encyclopedia of Algorithms

Living Edition
| Editors: Ming-Yang Kao

Exact Algorithms for Treewidth

Living reference work entry
First Online:
Received:
Accepted:
DOI: https://doi.org/10.1007/978-3-642-27848-8_515-1
How to cite

Years and Authors of Summarized Original Work

2008; Fomin, Kratsch, Todinca, Villanger

2012; Bodlaender, Fomin, Koster, Kratsch, Thilikos

2012; Fomin, Villanger

Problem Definition

The treewidth parameter intuitively measures whether the graph has a “treelike” structure. Given an undirected graph G = ( V, E), a tree decomposition of G is a pair \((\mathcal{X},T)\)

Keywords

Extremal combinatorics Potential maximal cliques Treewidth 
This is a preview of subscription content, log in to check access.

Recommended Reading

  1. 1.
    Arnborg S, Corneil DG, Proskurowski A (1987) Complexity of finding embeddings in a k-tree. SIAM J Algebr Discret Methods 8(2):277–284CrossRefMATHMathSciNetGoogle Scholar
  2. 2.
    Bodlaender HL (1996) A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J Comput 25(6):1305–1317CrossRefMATHMathSciNetGoogle Scholar
  3. 3.
    Bodlaender HL, Fomin FV, Koster AMCA, Kratsch D, Thilikos DM (2012) On exact algorithms for treewidth. ACM Trans Algorithms 9(1):12CrossRefMathSciNetGoogle Scholar
  4. 4.
    Bouchitté V, Todinca I (2001) Treewidth and minimum fill-in: grouping the minimal separators. SIAM J Comput 31(1):212–232CrossRefMATHMathSciNetGoogle Scholar
  5. 5.
    Bouchitté V, Todinca I (2002) Listing all potential maximal cliques of a graph. Theor Comput Sci 276(1–2):17–32CrossRefMATHGoogle Scholar
  6. 6.
    Fomin FV, Kratsch D (2010) Exact exponential algorithms, 1st edn. Springer, New YorkCrossRefMATHGoogle Scholar
  7. 7.
    Fomin FV, Villanger Y (2010) Finding induced subgraphs via minimal triangulations. In: Marion JY, Schwentick T (eds) STACS, Nancy. LIPIcs, vol 5. Schloss Dagstuhl – Leibniz-Zentrum fuer Informatik, pp 383–394Google Scholar
  8. 8.
    Fomin FV, Villanger Y (2012) Treewidth computation and extremal combinatorics. Combinatorica 32(3):289–308CrossRefMATHMathSciNetGoogle Scholar
  9. 9.
    Fomin FV, Kratsch D, Todinca I, Villanger Y (2008) Exact algorithms for treewidth and minimum fill-in. SIAM J Comput 38(3):1058–1079CrossRefMATHMathSciNetGoogle Scholar
  10. 10.
    Fomin FV, Todinca I, Villanger Y (2014) Large induced subgraphs via triangulations and cmso. In: Chekuri C (ed) SODA, Portland. SIAM, pp 582–583Google Scholar
  11. 11.
    Gogate V, Dechter R (2004) A complete anytime algorithm for treewidth. In: Chickering DM, Halpern JY (eds) UAI, Banff. AUAI Press, pp 201–208Google Scholar
  12. 12.
    Held M, Karp RM (1962) A dynamic programming approach to the sequencing problem. J Soc Ind Appl Math 10(1):196–210CrossRefMATHMathSciNetGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2015

Authors and Affiliations

  1. 1.INSA Centre Val de LoireUniversite d’OrleansOrléans cedex 2France