Skip to search formSkip to main contentSkip to account menuSemantic Scholar Semantic Scholar's Logo Search 210,178,700 papers from all fields of science

Search

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…

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…

Highly Cited

2007

Highly Cited

2007

It is well-known that constraint satisfaction problems (CSP) can be solved in time nO(k) if the treewidth of the primal graph of…

Review

2005

Review

2005

Treewidth is a graph parameter with several interesting theoretical and practical applications. This survey reviews algorithmic…

Review

1998

Highly Cited

1995

Highly Cited

1995

Abstract Various parameters of graphs connected to sparse matrix factorization and other applications can be approximated using…

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…

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…

Highly Cited

1993

Highly Cited

1993

In this paper we give, for all constantsk,l, explicit algorithms that, given a graphG=(V,E) with a tree-decomposition ofGwith…

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…