Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 210,178,700 papers from all fields of science
Search
Sign In
Create Free Account
Treewidth
Known as:
Width (disambiguation)
, Tree width
, Grid minor theorem
Expand
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
Bramble (graph theory)
Branch-decomposition
Cactus graph
Caterpillar 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
Marek Cygan
,
Jesper Nederlof
,
Marcin Pilipczuk
,
Michal Pilipczuk
,
Johan M. M. Van Rooij
,
J. O. Wojtaszczyk
IEEE Annual Symposium on Foundations of Computer…
2011
Corpus ID: 7704983
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
Review
2008
Review
2008
Combinatorial Optimization on Graphs of Bounded Treewidth
H. Bodlaender
,
A. Koster
Computer/law journal
2008
Corpus ID: 2264992
There are many graph problems that can be solved in linear or polynomial time with a dynamic programming algorithm when the input…
Expand
Highly Cited
2007
Highly Cited
2007
Can you beat treewidth?
D. Marx
IEEE Annual Symposium on Foundations of Computer…
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
Review
2005
Review
2005
Discovering Treewidth
H. Bodlaender
Conference on Current Trends in Theory and…
2005
Corpus ID: 15375213
Treewidth is a graph parameter with several interesting theoretical and practical applications. This survey reviews algorithmic…
Expand
Review
1998
Review
1998
A Partial k-Arboretum of Graphs with Bounded Treewidth
H. Bodlaender
Theoretical Computer Science
1998
Corpus ID: 5756724
Highly Cited
1995
Highly Cited
1995
Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
H. Bodlaender
,
J. Gilbert
,
H. Hafsteinsson
,
T. Kloks
J. Algorithms
1995
Corpus ID: 14491515
Abstract Various parameters of graphs connected to sparse matrix factorization and other applications can be approximated using…
Expand
Review
1993
Review
1993
A Tourist Guide through Treewidth
H. Bodlaender
Acta Cybernetica
1993
Corpus ID: 33329367
A short overview is given of many recent results in algorithmic graph theory that deal with the notions treewidth, and pathwidth…
Expand
Highly Cited
1993
Highly Cited
1993
A linear time algorithm for finding tree-decompositions of small treewidth
H. Bodlaender
Symposium on the Theory of Computing
1993
Corpus ID: 2028181
In this paper, we give for constant $k$ a linear-time algorithm that, given a graph $G=(V,E)$, determines whether the treewidth…
Expand
Highly Cited
1993
Highly Cited
1993
Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
H. Bodlaender
,
T. Kloks
J. Algorithms
1993
Corpus ID: 13846461
In this paper we give, for all constantsk,l, explicit algorithms that, given a graphG=(V,E) with a tree-decomposition ofGwith…
Expand
Highly Cited
1988
Highly Cited
1988
Dynamic Programming on Graphs with Bounded Treewidth
H. Bodlaender
International Colloquium on Automata, Languages…
1988
Corpus ID: 37438883
In this paper we study the complexity of graph decision problems, restricted to the class of graphs with treewidth k, (or…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE