Computing rank-width exactly

Authors:
Sang-il Oum
Affiliations:
Department of Mathematical Sciences, KAIST, 335 Gwahangno Yuseong-gu, Daejeon 305-701, South Korea
Venue:
Information Processing Letters
Year:
2009

Citing 6
Cited 0

Graph minors: X. obstructions to tree-decomposition

Journal of Combinatorial Theory Series B
Approximating clique-width and branch-width

Journal of Combinatorial Theory Series B
Faster integer multiplication

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Fourier meets möbius: fast subset convolution

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Finding Branch-Decompositions and Rank-Decompositions

SIAM Journal on Computing
Computing branchwidth via efficient triangulations and blocks

Discrete Applied Mathematics

Quantified Score

Hi-index	0.93

Visualization

Abstract

We prove that the rank-width of an n-vertex graph can be computed exactly in time O(2^nn^3log^2nloglogn). To improve over a trivial O(3^nlogn)-time algorithm, we develop a general framework for decompositions on which an optimal decomposition can be computed efficiently. This framework may be used for other width parameters, including the branch-width of matroids and the carving-width of graphs.