Finding branch-decompositions and rank-decompositions

Cited 80 time in webofscience Cited 0 time in scopus
  • Hit : 618
  • Download : 14494
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 of these algorithms are fixed-parameter tractable, that is, they run in time O(n(3)) where n is the number of vertices / elements of the input, for each constant value of k and any fixed finite field. The previous best algorithm for construction of a branch-decomposition or a rank-decomposition of optimal width due to Oum and Seymour [J. Combin. Theory Ser. B, 97 (2007), pp. 385 - 393] is not fixed-parameter tractable.
Publisher
SIAM PUBLICATIONS
Issue Date
2008
Language
English
Article Type
Article
Description

Accepted to SIAM J. Comput., 2008.

Keywords

MONADIC 2ND-ORDER LOGIC; FIXED CLIQUE-WIDTH; VERTEX-MINORS; GRAPHS; MATROIDS; RECOGNITION; ALGORITHMS

Citation

SIAM JOURNAL ON COMPUTING, v.38, no.3, pp.1012 - 1032

ISSN
0097-5397
DOI
10.1137/070685920
URI
http://hdl.handle.net/10203/5251
Appears in Collection
MA-Journal Papers(저널논문)
Files in This Item
000258895100012.pdf(286.17 kB)Download
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 80 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0