Treewidth

Known as: Width (disambiguation), Tree width, Grid minor theorem 
In graph theory, the treewidth of an undirected graph is a number associated with the graph. Treewidth may be defined in several equivalent ways… (More)
Wikipedia

Related topics

Related topics

50 relations
Bramble (graph theory)Branch-decompositionCactus graphCaterpillar tree
(More)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal
We obtain a number of lower bounds on the running time of algorithms solving problems on graphs of bounded treewidth. We prove… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Treewidth computations I. Upper bounds
Article history: Received 22 September 2008 Revised 29 March 2009 Available online 19 April 2009 
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Can you beat treewidth?
It is well-known that constraint satisfaction problems (CSP) can be solved in time nO(k) if the treewidth of the primal graph of… (More)
Is this relevant?
Highly Cited
2004
Highly Cited
2004
A Complete Anytime Algorithm for Treewidth
In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. This… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics
We systematically investigate the connections between con strai t satisfaction problems, structures of bounded treewidth, and d… (More)
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Treewidth: Computational Experiments
ManyNP-hard graph problems can be solved in polynomial time for graphs with bounded treewidth. Equivalent results are known for… (More)
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Efficient Approximation for Triangulation of Minimum Treewidth
Finding triangulations of minimum treewidth for graphs is c entral to many problems in computer science. Real-world problems in… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Diameter and Treewidth in Minor-Closed Graph Families
It is known that any planar graph with diameter D has treewidth O(D) , and this fact has been used as the basis for several… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1996
Highly Cited
1996
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
In this paper, we give for constant k a linear-time algorithm that, given a graph G (V, E), determines whether the treewidth of G… (More)
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
Various parameters of graphs connected to sparse matrix factoriza-tion and other applications can be approximated using an… (More)
Is this relevant?