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ý.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Oum, S., Seymour, P.: Approximating clique-width and branch-width (2004) (submitted)
Courcelle, B., Olariu, S.: Upper bounds to the clique width of graphs. Discrete Appl. Math. 101, 77–114 (2000)
Oum, S.: Rank-width and vertex-minors. J. Combin. Theory Ser. B (2005) (to appear)
Oxley, J.G.: Matroid theory. Oxford University Press, New York (1992)
Robertson, N., Seymour, P.: Graph minors. X. Obstructions to tree-decomposition. J. Combin. Theory Ser. B 52, 153–190 (1991)
Iwata, S., Fleischer, L., Fujishige, S.: A combinatorial strongly polynomial algorithm for minimizing submodular functions. Journal of the ACM (JACM) 48, 761–777 (2001)
Geelen, J.F.: Matchings, matroids and unimodular matrices. PhD thesis, University of Waterloo (1995)
Courcelle, B.: The monadic second-order logic of graphs XV: On a conjecture by D. Seese (2004) (submitted)
Seese, D.: The structure of the models of decidable monadic theories of graphs. Ann. Pure Appl. Logic 53, 169–195 (1991)
Hliněný, P.: A parametrized algorithm for matroid branch-width (2002) (submitted)
Wanke, E.: k-NLC graphs and polynomial algorithms. Discrete Appl. Math. 54, 251–266 (1994)
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)
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)
Gerber, M.U., Kobler, D.: Algorithms for vertex-partitioning problems on graphs with fixed clique-width. Theoret. Comput. Sci. 299, 719–734 (2003)
Kobler, D., Rotics, U.: Edge dominating set and colorings on graphs with fixed clique-width. Discrete Appl. Math. 126, 197–221 (2003)
Johnson, J.L.: Polynomial time recognition and optimization algorithms on special classes of graphs. PhD thesis, Vanderbuilt University (2003)
Courcelle, B., Oum, S.: Vertex-minors, monadic second-order logic, and a conjecture by Seese (2004) (submitted)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Oum, Si. (2005). Approximating Rank-Width and Clique-Width Quickly. In: Kratsch, D. (eds) Graph-Theoretic Concepts in Computer Science. WG 2005. Lecture Notes in Computer Science, vol 3787. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11604686_5
Download citation
DOI: https://doi.org/10.1007/11604686_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31000-6
Online ISBN: 978-3-540-31468-4
eBook Packages: Computer ScienceComputer Science (R0)