## Approximating clique-width and branch-width (2006)

Venue: | JOURNAL OF COMBINATORIAL THEORY, SERIES B |

Citations: | 57 - 6 self |

### BibTeX

@ARTICLE{Oum06approximatingclique-width,

author = {Sang-il Oum and Paul Seymour},

title = {Approximating clique-width and branch-width},

journal = {JOURNAL OF COMBINATORIAL THEORY, SERIES B},

year = {2006},

volume = {96},

pages = {514--528}

}

### OpenURL

### Abstract

We construct a polynomial-time algorithm to approximate the branch-width of certain symmetric submodular functions, and give two applications. The first is to graph “clique-width”. Clique-width is a measure of the difficulty of decomposing a graph in a kind of tree-structure, and if a graph has clique-width at most k then the corresponding decomposition of the graph is called a “k-expression”. We find (for fixed k) an O(n 9 log n)-time algorithm that, with input an n-vertex graph, outputs either a (2 3k+2 − 1)expression for the graph, or a true statement that the graph has clique-width at least k + 1. (The best earlier algorithm algorithm, by Johansson [13], constructed a k log n-expression for graphs of clique-width at most k.) It was already known that several graph problems, NPhard on general graphs, are solvable in polynomial time if the input graph comes equipped with a k-expression (for fixed k). As a consequence of our algorithm, the same conclusion follows under the weaker hypothesis that the input graph has clique-width at most k (thus, we no longer need to be provided with an explicit k-expression). Another application is to the area of matroid branch-width. For fixed k, we find an O(n 4)time algorithm that, with input an n-element matroid in terms of its rank oracle, either outputs a branch-decomposition of width at most 3k − 1 or a true statement that the matroid has branch-width at least k + 1. The previous algorithm by Hliněn´y [11] was only for representable matroids.

### Citations

190 |
A linear-time algorithm for finding tree-decompositions of small treewidth
- Bodlaender
- 1996
(Show Context)
Citation Context ...omposition. • In particular, one of these problems is the problem of deciding whether a graph has tree-width at most k. Consequently, for fixed k there is a polynomial (indeed, linear) time algorithm =-=[1]-=- to test whether an input graph has tree-width at most k, and if so to output the corresponding decomposition. For inputs of bounded clique-width, less progress has so far been made. (We will define c... |

163 | Graph Minors X. Obstructions to Treedecomposition
- Robertson, Seymour
- 1991
(Show Context)
Citation Context ...omposition of G with clique-width at most 2 3k+2 − 1. Its running time is O(n 9 log n). The main tool for this algorithm is branch-width, which is closely related to tree-width, and was introduced in =-=[19]-=-. We develop a general algorithm to approximate the branch-width of certain symmetric submodular functions. Then we define the “rank-width” of a graph to be the branch-width of a symmetric submodular ... |

156 |
A linear recognition algorithm for cographs
- Corneil, Perl, et al.
- 1985
(Show Context)
Citation Context ...th 2; and trees have clique-width at most 3 [7]. For some classes of graphs, it is known that clique-width is bounded and algorithms to construct a k-expression have been found. For example, cographs =-=[4]-=-, graphs of clique-width at most 3 [2], and P4-sparse graphs (every five vertices have at most one induced subgraph isomorphic to a path of length 3) [3] have such algorithms. 4. Extension of a submod... |

142 | The expression of graph properties and graph transformations in monadic second-order logic, in
- Courcelle
- 1997
(Show Context)
Citation Context ... OUM AND PAUL SEYMOUR graph property expressible in monadic second order logic with quantifications over vertices, vertex sets, edges, and edge sets (MSO2-logic) can be solved in polynomial time (see =-=[6]-=-). • For fixed k there is a polynomial time algorithm [18] that either decides that an input graph has tree-width at least k + 1, or outputs a decomposition of tree-width at most 4k. • Consequently, b... |

112 | Linear time solvable optimization problems on graphs of bounded clique-width
- Courcelle, Makowsky, et al.
(Show Context)
Citation Context ...s partition problems [8] are solvable in polynomial time; and so is any problem that can be expressed in monadic second order logic with quantifications over vertices and vertex sets (MSO1-logic; see =-=[3, 6]-=-). • For fixed (general) k there was so far no known polynomial time algorithm that either decides that an input graph has clique-width at least k +1, or outputs a decomposition of clique-width bounde... |

67 |
Tree-width and tangles: an new connectivity measure and some applications
- Reed
- 1997
(Show Context)
Citation Context ...at W ⊆ V is well-linked with respect to f if for every partition (X, Y ) of W and every Z with X ⊆ Z ⊆ V \ Y , we have f(Z) ≥ min(|X|, |Y |). This notion is analogous to the notion of well-linkedness =-=[17]-=- related to tree-width of graphs. Theorem 5.1. Let V be a finite set with |V | ≥ 2, and let f : 2 V → Z be a symmetric submodular function such that f(∅) = 0. If with respect to f there is a well-link... |

48 |
Excluding a planar graph
- V
- 1986
(Show Context)
Citation Context ...ic second order logic with quantifications over vertices, vertex sets, edges, and edge sets (MSO2-logic) can be solved in polynomial time (see [6]). • For fixed k there is a polynomial time algorithm =-=[18]-=- that either decides that an input graph has tree-width at least k + 1, or outputs a decomposition of tree-width at most 4k. • Consequently, by combining these algorithms, it follows that the same cla... |

45 | Upper bounds to the clique width of graphs
- Courcelle, Olariu
- 2000
(Show Context)
Citation Context ... for purposes of comparison. Having bounded clique-width is more general than having bounded tree-width, in the following sense. Every graph G of tree-width at most k has clique-width at most O(2 k ) =-=[5, 7]-=-, and for such graphs (for k fixed) the clique-width of G can be determined in linear time [9]. No bound in the reverse direction holds, for there are graphs of arbitrary large tree-width with clique-... |

41 |
On the relationship between clique-width and treewidth (extended abstract
- Corneil, Rotics
(Show Context)
Citation Context ... for purposes of comparison. Having bounded clique-width is more general than having bounded tree-width, in the following sense. Every graph G of tree-width at most k has clique-width at most O(2 k ) =-=[5, 7]-=-, and for such graphs (for k fixed) the clique-width of G can be determined in linear time [9]. No bound in the reverse direction holds, for there are graphs of arbitrary large tree-width with clique-... |

38 | Matroid Decomposition - Truemper - 1992 |

35 |
Polynomial time recognition of clique-width �3 graphs
- Corneil, Habib, et al.
- 2000
(Show Context)
Citation Context ...ost 3 [7]. For some classes of graphs, it is known that clique-width is bounded and algorithms to construct a k-expression have been found. For example, cographs [4], graphs of clique-width at most 3 =-=[2]-=-, and P4-sparse graphs (every five vertices have at most one induced subgraph isomorphic to a path of length 3) [3] have such algorithms. 4. Extension of a submodular function In this section, we defi... |

23 | How to solve NP-hard graph problems on clique-width bounded graphs in polynomial time
- Espelage, Gurski, et al.
- 2001
(Show Context)
Citation Context ...aller than the corresponding set for tree-width, but still of interest. For instance, deciding whether the graph is Hamiltonian [22], finding the chromatic number [14], and various partition problems =-=[8]-=- are solvable in polynomial time; and so is any problem that can be expressed in monadic second order logic with quantifications over vertices and vertex sets (MSO1-logic; see [3, 6]). • For fixed (ge... |

22 |
Matroid Theory, Oxford Science
- Oxley
- 1992
(Show Context)
Citation Context ...nimum width of a branch-decomposition of f. (If |V | ≤ 1, we define bw(f) = f(∅).) For the application to matroids, we assume that the reader is familiar with the basic notions of matroid theory (see =-=[16]-=-). Let us review matroid theory briefly for the purpose of this paper. A matroid M = (E, r) is a pair formed by a finite set E of elements and a rank function r : 2 E → Z satisfying the following axio... |

21 |
Satoru Fujishige. A combinatorial strongly polynomial algorithm for minimizing submodular functions
- Iwata, Fleischer
(Show Context)
Citation Context ...te f from f ∗ . For the first analysis, let γ be the time to compute f(X) for any set X. In this case we shall use f ∗ = fmin. To calculate fmin, we use the submodular function minimization algorithm =-=[12]-=-, whose running time is O(n 5 γ log M) where M is the maximum value of f and n = |V |. Thus, we can calculate fmin in O(n 5 γ log n) time. Finding a base X can be done by calculating f ∗ at most O(n) ... |

19 |
Edge dominating set and colorings on graphs with fixed clique-width
- Kobler, Rotics
- 2003
(Show Context)
Citation Context ...e-width. This class of problems is smaller than the corresponding set for tree-width, but still of interest. For instance, deciding whether the graph is Hamiltonian [22], finding the chromatic number =-=[14]-=-, and various partition problems [8] are solvable in polynomial time; and so is any problem that can be expressed in monadic second order logic with quantifications over vertices and vertex sets (MSO1... |

14 | The tree-width of clique-width bounded graphs without Kn,n
- Gurski, Wanke
- 1928
(Show Context)
Citation Context ...ection holds, for there are graphs of arbitrary large tree-width with clique-width at most k. (But, for fixed t, if G does not contain Kt,t as a subgraph, then the tree-width is at most 3k(t − 1) − 1 =-=[10]-=-.) The algorithmic situation with tree-width is as follows: • Numerous problems have been shown to be solvable in polynomial time when the input graph is presented together with a decomposition of bou... |

12 | Deciding clique-width for graphs of bounded tree-width
- Espelage, Gurski, et al.
(Show Context)
Citation Context ...-width, in the following sense. Every graph G of tree-width at most k has clique-width at most O(2 k ) [5, 7], and for such graphs (for k fixed) the clique-width of G can be determined in linear time =-=[9]-=-. No bound in the reverse direction holds, for there are graphs of arbitrary large tree-width with clique-width at most k. (But, for fixed t, if G does not contain Kt,t as a subgraph, then the tree-wi... |

5 |
k-NLC graphs and polynomial algorithms. Discrete Applied Mathematics
- Wanke
- 1994
(Show Context)
Citation Context ...th a decomposition of bounded clique-width. This class of problems is smaller than the corresponding set for tree-width, but still of interest. For instance, deciding whether the graph is Hamiltonian =-=[22]-=-, finding the chromatic number [14], and various partition problems [8] are solvable in polynomial time; and so is any problem that can be expressed in monadic second order logic with quantifications ... |

2 |
log n-approximative NLCk-decomposition in O(n 2k+1 ) time (extended abstract
- Johansson
- 2001
(Show Context)
Citation Context ...input an n-vertex graph, outputs either a (2 3k+2 − 1)expression for the graph, or a true statement that the graph has clique-width at least k + 1. (The best earlier algorithm algorithm, by Johansson =-=[13]-=-, constructed a k log n-expression for graphs of clique-width at most k.) It was already known that several graph problems, NPhard on general graphs, are solvable in polynomial time if the input graph... |