Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.
Treewidth
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
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
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
2000
Highly Cited
2000
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
Review
1998
Review
1998
The notion of treewidth has seen to be a powerful vehicle for many graph algorithmic studies. This survey paper wants to give an… Expand
Highly Cited
1996
Highly Cited
1996
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
1996
Highly Cited
1996
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
1995
Highly Cited
1995
Abstract Various parameters of graphs connected to sparse matrix factorization and other applications can be approximated using… Expand
Review
1993
Review
1993
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
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
1988
Highly Cited
1988
In this paper we study the complexity of graph decision problems, restricted to the class of graphs with treewidth k, (or… Expand