DC Field | Value | Language |
---|---|---|
dc.contributor.author | Oum, Sang-il | ko |
dc.date.accessioned | 2009-06-15T01:41:46Z | - |
dc.date.available | 2009-06-15T01:41:46Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 2008-11 | - |
dc.identifier.citation | ACM TRANSACTIONS ON ALGORITHMS , v.5, no.1, pp.1 - 20 | - |
dc.identifier.issn | 1549-6325 | - |
dc.identifier.uri | http://hdl.handle.net/10203/9386 | - |
dc.description.abstract | Rank-width was defined by Oum and Seymour [ 2006] 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(vertical bar V vertical bar(9) log vertical bar V vertical bar) 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(vertical bar V vertical bar(4))-time algorithm with f(k) = 3k + 1 by constructing a subroutine for the previous algorithm; we avoid generic algorithms minimizing submodular functions used by Oum and Seymour. Another one is an O(vertical bar V vertical bar(3))-time algorithm with f(k) = 24k, achieved by giving a reduction from graphs to binary matroids; then we use an approximation algorithm for matroid branch-width by Hlineny [2005]. Finally we construct an O(vertical bar V vertical bar(3))-time algorithm with f(k) = 3k - 1 by combining the ideas of the two previously cited papers. | - |
dc.language | English | - |
dc.language.iso | en_US | en |
dc.publisher | ASSOCIATION FOR COMPUTING MACHINARY, INC. | - |
dc.subject | VERTEX-MINORS | - |
dc.subject | BRANCH-WIDTH | - |
dc.subject | GRAPHS | - |
dc.subject | OBSTRUCTIONS | - |
dc.subject | ALGORITHMS | - |
dc.title | Approximating Rank-Width and Clique-Width Quickly | - |
dc.type | Article | - |
dc.identifier.wosid | 000265882300010 | - |
dc.identifier.scopusid | 2-s2.0-57849167967 | - |
dc.type.rims | ART | - |
dc.citation.volume | 5 | - |
dc.citation.issue | 1 | - |
dc.citation.beginningpage | 1 | - |
dc.citation.endingpage | 20 | - |
dc.citation.publicationname | ACM TRANSACTIONS ON ALGORITHMS | - |
dc.identifier.doi | 10.1145/1435375.1435385 | - |
dc.embargo.liftdate | 9999-12-31 | - |
dc.embargo.terms | 9999-12-31 | - |
dc.contributor.localauthor | Oum, Sang-il | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | Approximation algorithms | - |
dc.subject.keywordAuthor | branch-width | - |
dc.subject.keywordAuthor | clique-width | - |
dc.subject.keywordAuthor | rank-width | - |
dc.subject.keywordAuthor | matroids | - |
dc.subject.keywordPlus | VERTEX-MINORS | - |
dc.subject.keywordPlus | BRANCH-WIDTH | - |
dc.subject.keywordPlus | GRAPHS | - |
dc.subject.keywordPlus | OBSTRUCTIONS | - |
dc.subject.keywordPlus | ALGORITHMS | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.