# Treewidth

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2011

Highly Cited

2011

- ACM Trans. Algorithms
- 2011

We obtain a number of lower bounds on the running time of algorithms solving problems on graphs of bounded treewidth. We proveâ€¦Â (More)

Is this relevant?

Highly Cited

2010

Highly Cited

2010

- Inf. Comput.
- 2010

Article history: Received 22 September 2008 Revised 29 March 2009 Available online 19 April 2009Â

Is this relevant?

Highly Cited

2007

Highly Cited

2007

- 48th Annual IEEE Symposium on Foundations ofâ€¦
- 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â€¦Â (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- UAI
- 2004

In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. Thisâ€¦Â (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- CP
- 2002

We systematically investigate the connections between con strai t satisfaction problems, structures of bounded treewidth, and dâ€¦Â (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- Electronic Notes in Discrete Mathematics
- 2001

ManyNP-hard graph problems can be solved in polynomial time for graphs with bounded treewidth. Equivalent results are known forâ€¦Â (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- UAI
- 2001

Finding triangulations of minimum treewidth for graphs is c entral to many problems in computer science. Real-world problems inâ€¦Â (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- Algorithmica
- 2000

It is known that any planar graph with diameter D has treewidth O(D) , and this fact has been used as the basis for severalâ€¦Â (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- SIAM J. Comput.
- 1996

In this paper, we give for constant k a linear-time algorithm that, given a graph G (V, E), determines whether the treewidth of Gâ€¦Â (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- J. Algorithms
- 1995

Various parameters of graphs connected to sparse matrix factoriza-tion and other applications can be approximated using anâ€¦Â (More)

Is this relevant?