# Branch-decomposition

## Papers overview

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

2010

2010

- ISAAC
- 2010

Â

Is this relevant?

Highly Cited

2008

Highly Cited

2008

- ACM Trans. Algorithms
- 2008

We give an <i>O</i>(<i>n</i><sup>3</sup>) time algorithm for constructing a minimum-width branch-decomposition of a given planarâ€¦Â (More)

Is this relevant?

2008

2008

- WEA
- 2008

A graph of small branchwidth admits efficient dynamic programming algorithms for many NP-hard problems on the graph. A key stepâ€¦Â (More)

Is this relevant?

2008

2008

- ALENEX
- 2008

We propose efficient implementations of Seymour and Thomas algorithm which, given a planar graph and an integer Î², decidesâ€¦Â (More)

Is this relevant?

Highly Cited

2006

Highly Cited

2006

- J. Comb. Theory, Ser. B
- 2006

We construct a polynomial-time algorithm to approximate the branch-width of certain symmetric submodular functions, and give twoâ€¦Â (More)

Is this relevant?

2006

2006

- J. Comb. Theory, Ser. B
- 2006

A (Î´, Î³)â€“net in a matroid M is a pair (N,P) where N is a minor of M , P is a set of series classes in N , |P| â‰¥ Î´, and theâ€¦Â (More)

Is this relevant?

2005

2005

- INFORMS Journal on Computing
- 2005

T notion of branch decompositions and its related connectivity invariant for graphs, branchwidth, were introduced by Robertsonâ€¦Â (More)

Is this relevant?

2005

2005

- IJCAI
- 2005

Hypertree-decomposition is the most general approach in the literature for identifying tractable computation problems encoded asâ€¦Â (More)

Is this relevant?

2004

2004

- Networks
- 2004

Given a simple graph G, a simple connected graph H, and a branch decomposition of G of width k, we present a practical algorithmâ€¦Â (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- INFORMS Journal on Computing
- 2003

Â

Is this relevant?