Branch-decomposition

Known as: Branch-width, Branchwidth, Width (disambiguation) 
In graph theory, a branch-decomposition of an undirected graph G is a hierarchical clustering of the edges of G, represented by an unrooted binary… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
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)
  • figure 1
  • figure 2
Is this relevant?
2008
2008
A graph of small branchwidth admits efficient dynamic programming algorithms for many NP-hard problems on the graph. A key step… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
Is this relevant?
2008
2008
We propose efficient implementations of Seymour and Thomas algorithm which, given a planar graph and an integer β, decides… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
Highly Cited
2006
Highly Cited
2006
We construct a polynomial-time algorithm to approximate the branch-width of certain symmetric submodular functions, and give two… (More)
  • figure 1
Is this relevant?
2006
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
T notion of branch decompositions and its related connectivity invariant for graphs, branchwidth, were introduced by Robertson… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
2005
2005
Hypertree-decomposition is the most general approach in the literature for identifying tractable computation problems encoded as… (More)
  • figure 1
  • figure 2
Is this relevant?
2004
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)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
 
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?