A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Approximating rank-width and clique-width quickly

2008
*
ACM Transactions on Algorithms
*

Rank-width was defined by Oum and Seymour [2006. Approximating clique-width and branchwidth. J. Combin. Theory Ser. B 96, 4, 514-528] to investigate clique-width. They constructed an algorithm that either outputs a rank-decomposition of width at most f (k) for some function f or confirms that rank-width is larger than k in time O(|V | 9 log |V |) for an input graph G = (V, E) and a fixed k. We develop three separate algorithms of this kind with faster running time. We construct an O(|V | 4

doi:10.1145/1435375.1435385
fatcat:cvnrv64ky5bypobh7dx46m2sse