We present a new algorithm that can output the rank-decomposition of width at most k of a graph if such exists. For that we use an algorithm that, for an input matroid represented over a fixed finite field, outputs its branch-decomposition of width at most k if such exists. This algorithm works also for partitioned matroids. Both these algorithms are fixed-parameter tractable, that is, they run in time O(n3) for each fixed value of k where n is the number of vertices / elements of the input. (The previous best algorithm for construction of a branch-decomposition or a rank-decomposition of optimal width due to Oum and Seymour [Testing branch-width. J. Combin. Theory Ser. B, 97(3) (2007) 385-393] is not fixed-parameter tractable). © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Hliněný, P., & Oum, S. I. (2007). Finding branch-decompositions and rank-decompositions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4698 LNCS, pp. 163–174). Springer Verlag. https://doi.org/10.1007/978-3-540-75520-3_16
Mendeley helps you to discover research relevant for your work.