Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
For the vast majority of local problems on graphs of small tree width (where by local we mean that a solution can be verified by… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Can you beat treewidth?
  • D. Marx
  • 48th Annual IEEE Symposium on Foundations of…
  • 2007
    • Corpus ID: 9342216
It is well-known that constraint satisfaction problems (CSP) can be solved in time nO(k) if the treewidth of the primal graph of… Expand
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics
We systematically investigate the connections between constraint satisfaction problems, structures of bounded treewidth, and… Expand
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Diameter and Treewidth in Minor-Closed Graph Families
Abstract. It is known that any planar graph with diameter D has treewidth O(D) , and this fact has been used as the basis for… Expand
  • 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… Expand
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
In this paper we give, for all constantsk,l, explicit algorithms that, given a graphG=(V,E) with a tree-decomposition ofGwith… Expand
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
Abstract Various parameters of graphs connected to sparse matrix factorization and other applications can be approximated using… Expand
Is this relevant?
Highly Cited
1993
Highly Cited
1993
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… Expand
Is this relevant?
Highly Cited
1988
Highly Cited
1988
Dynamic Programming on Graphs with Bounded Treewidth
In this paper we study the complexity of graph decision problems, restricted to the class of graphs with treewidth k, (or… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE