# Approximating Rank-Width and Clique-Width Quickly

• Sang-il Oum
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3787)

## Abstract

Rank-width is defined by Seymour and the author to investigate clique-width; they show that graphs have bounded rank-width if and only if they have bounded clique-width. It is known that many hard graph problems have polynomial-time algorithms for graphs of bounded clique-width, however, requiring a given decomposition corresponding to clique-width (k-expression); they remove this requirement by constructing an algorithm that either outputs a rank-decomposition of width at most f(k) for some function f or confirms rank-width is larger than k in O(|V|9log |V|) time for an input graph G = (V,E) and a fixed k. This can be reformulated in terms of clique-width as an algorithm that either outputs a (21 + f(k)–1)-expression or confirms clique-width is larger than k in O(|V|9log |V|) time for fixed k.

In this paper, we develop two separate algorithms of this kind with faster running time. We construct a O(|V|4)-time algorithm with f(k) = 3k + 1 by constructing a subroutine for the previous algorithm; we may now avoid using general submodular function minimization algorithms used by Seymour and the author. Another one is a O(|V|3)-time algorithm with f(k) = 24k by giving a reduction from graphs to binary matroids; then we use an approximation algorithm for matroid branch-width by Hliněný.

## References

1. 1.
Oum, S., Seymour, P.: Approximating clique-width and branch-width (2004) (submitted)Google Scholar
2. 2.
Courcelle, B., Olariu, S.: Upper bounds to the clique width of graphs. Discrete Appl. Math. 101, 77–114 (2000)
3. 3.
Oum, S.: Rank-width and vertex-minors. J. Combin. Theory Ser. B (2005) (to appear)Google Scholar
4. 4.
Oxley, J.G.: Matroid theory. Oxford University Press, New York (1992)
5. 5.
Robertson, N., Seymour, P.: Graph minors. X. Obstructions to tree-decomposition. J. Combin. Theory Ser. B 52, 153–190 (1991)
6. 6.
Iwata, S., Fleischer, L., Fujishige, S.: A combinatorial strongly polynomial algorithm for minimizing submodular functions. Journal of the ACM (JACM) 48, 761–777 (2001)
7. 7.
Geelen, J.F.: Matchings, matroids and unimodular matrices. PhD thesis, University of Waterloo (1995)Google Scholar
8. 8.
Courcelle, B.: The monadic second-order logic of graphs XV: On a conjecture by D. Seese (2004) (submitted)Google Scholar
9. 9.
Seese, D.: The structure of the models of decidable monadic theories of graphs. Ann. Pure Appl. Logic 53, 169–195 (1991)
10. 10.
Hliněný, P.: A parametrized algorithm for matroid branch-width (2002) (submitted)Google Scholar
11. 11.
Wanke, E.: k-NLC graphs and polynomial algorithms. Discrete Appl. Math. 54, 251–266 (1994)
12. 12.
Courcelle, B., Makowsky, J.A., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput. Syst. 33, 125–150 (2000)
13. 13.
Espelage, W., Gurski, F., Wanke, E.: How to solve NP-hard graph problems on clique-width bounded graphs in polynomial time. In: Brandstädt, A., Le, V.B. (eds.) WG 2001. LNCS, vol. 2204, p. 117. Springer, Heidelberg (2001)
14. 14.
Gerber, M.U., Kobler, D.: Algorithms for vertex-partitioning problems on graphs with fixed clique-width. Theoret. Comput. Sci. 299, 719–734 (2003)
15. 15.
Kobler, D., Rotics, U.: Edge dominating set and colorings on graphs with fixed clique-width. Discrete Appl. Math. 126, 197–221 (2003)
16. 16.
Johnson, J.L.: Polynomial time recognition and optimization algorithms on special classes of graphs. PhD thesis, Vanderbuilt University (2003)Google Scholar
17. 17.
Courcelle, B., Oum, S.: Vertex-minors, monadic second-order logic, and a conjecture by Seese (2004) (submitted)Google Scholar