DC Field | Value | Language |
---|---|---|
dc.contributor.author | Hlineny, P | ko |
dc.contributor.author | Oum, Sang-il | ko |
dc.date.accessioned | 2008-06-23T06:12:21Z | - |
dc.date.available | 2008-06-23T06:12:21Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 2008 | - |
dc.identifier.citation | SIAM JOURNAL ON COMPUTING, v.38, no.3, pp.1012 - 1032 | - |
dc.identifier.issn | 0097-5397 | - |
dc.identifier.uri | http://hdl.handle.net/10203/5251 | - |
dc.description | Accepted to SIAM J. Comput., 2008. | en |
dc.description.abstract | 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. | - |
dc.description.sponsorship | The first author: Supported by Czech research grant GAČR 201/08/0308 and by Research intent MSM0021622419 of the Czech Ministry of Education. The second author: This research was done while the second author was at Georgia Institute of Technology and University of Waterloo. Partially supported by NSF grant DMS 0354742 and the SRC Program of Korea Science and Engineering Foundation (KOSEF) grant funded by the Korea government (MOST) (No. R11-2007-035-01002-0). | en |
dc.language | English | - |
dc.language.iso | en_US | en |
dc.publisher | SIAM PUBLICATIONS | - |
dc.subject | MONADIC 2ND-ORDER LOGIC | - |
dc.subject | FIXED CLIQUE-WIDTH | - |
dc.subject | VERTEX-MINORS | - |
dc.subject | GRAPHS | - |
dc.subject | MATROIDS | - |
dc.subject | RECOGNITION | - |
dc.subject | ALGORITHMS | - |
dc.title | Finding branch-decompositions and rank-decompositions | - |
dc.type | Article | - |
dc.identifier.wosid | 000258895100012 | - |
dc.identifier.scopusid | 2-s2.0-55249112968 | - |
dc.type.rims | ART | - |
dc.citation.volume | 38 | - |
dc.citation.issue | 3 | - |
dc.citation.beginningpage | 1012 | - |
dc.citation.endingpage | 1032 | - |
dc.citation.publicationname | SIAM JOURNAL ON COMPUTING | - |
dc.identifier.doi | 10.1137/070685920 | - |
dc.contributor.localauthor | Oum, Sang-il | - |
dc.contributor.nonIdAuthor | Hlineny, P | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | rank-width | - |
dc.subject.keywordAuthor | clique-width | - |
dc.subject.keywordAuthor | branch-width | - |
dc.subject.keywordAuthor | fixed-parameter tractable algorithm | - |
dc.subject.keywordAuthor | graph | - |
dc.subject.keywordAuthor | matroid | - |
dc.subject.keywordPlus | MONADIC 2ND-ORDER LOGIC | - |
dc.subject.keywordPlus | FIXED CLIQUE-WIDTH | - |
dc.subject.keywordPlus | VERTEX-MINORS | - |
dc.subject.keywordPlus | GRAPHS | - |
dc.subject.keywordPlus | MATROIDS | - |
dc.subject.keywordPlus | RECOGNITION | - |
dc.subject.keywordPlus | ALGORITHMS | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.