Branch-width is defined for graphs, matroids, and more generally, connectivity functions. We show that for each constant k, there is a polynomial-time (in | V | ) ...

Sep 25, 2013 · Branch-width is defined for graphs, matroids, and more generally, connectivity functions. We show that for each constant k, there is a ...

Branch-width is defined for graphs, matroids, and more generally, connectivity functions. We show that for each constant k, there is a polynomial-time (in |V|) ...

Jan 23, 2006 · (1) Begin with T = {X : |X| ≤ 1,f(X) ≤ k}. (2) Test (L1). If it fails, then no loose f-tangle of order k + 1.

Branch-width is defined for graphs, matroids, and more generally, connectivity functions. We show that for each constant k, there is a polynomial-time (in |V|) ...

The width of the branch-decomposition is the maximum width of any of its e-separations. The branchwidth of G is the minimum width of a branch-decomposition of G ...

This arti- cle offers a practical branch decomposition-based algorithm to test whether an input graph has branchwidth at most k − 1 for some integer k at least ...

Let f be a connectivity function on 2V . Then no loose f-tangle of order k + 1 exists if and only if the branch-width of f is at most k.

For positive integers m and n, let A ∈ Zm×n, b ∈ Zm, and c ∈ Zn. Consider the following integer programming problems: (IPF) Find x ∈ Zn satisfying (Ax = b, ...

A graph can have several different branch decompositions. We say that the width of a branch decomposition is the largest cardinality (or order) of all of its ...