Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

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

Is this relevant?

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

Is this relevant?

Highly Cited

2004

Highly Cited

2004

In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. This… Expand

Is this relevant?

Highly Cited

2002

Highly Cited

2002

We systematically investigate the connections between constraint satisfaction problems, structures of bounded treewidth, and… Expand

Is this relevant?

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

Is this relevant?

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

Is this relevant?

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

Is this relevant?

Highly Cited

1995

Highly Cited

1995

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

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

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?