Approximating Rank-Width and Clique-Width Quickly

Cited 56 time in webofscience Cited 0 time in scopus
  • Hit : 401
  • Download : 69
DC FieldValueLanguage
dc.contributor.authorOum, Sang-ilko
dc.date.accessioned2009-06-15T01:41:46Z-
dc.date.available2009-06-15T01:41:46Z-
dc.date.created2012-02-06-
dc.date.created2012-02-06-
dc.date.issued2008-11-
dc.identifier.citationACM TRANSACTIONS ON ALGORITHMS , v.5, no.1, pp.1 - 20-
dc.identifier.issn1549-6325-
dc.identifier.urihttp://hdl.handle.net/10203/9386-
dc.description.abstractRank-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.languageEnglish-
dc.language.isoen_USen
dc.publisherASSOCIATION FOR COMPUTING MACHINARY, INC.-
dc.subjectVERTEX-MINORS-
dc.subjectBRANCH-WIDTH-
dc.subjectGRAPHS-
dc.subjectOBSTRUCTIONS-
dc.subjectALGORITHMS-
dc.titleApproximating Rank-Width and Clique-Width Quickly-
dc.typeArticle-
dc.identifier.wosid000265882300010-
dc.identifier.scopusid2-s2.0-57849167967-
dc.type.rimsART-
dc.citation.volume5-
dc.citation.issue1-
dc.citation.beginningpage1-
dc.citation.endingpage20-
dc.citation.publicationnameACM TRANSACTIONS ON ALGORITHMS-
dc.identifier.doi10.1145/1435375.1435385-
dc.embargo.liftdate9999-12-31-
dc.embargo.terms9999-12-31-
dc.contributor.localauthorOum, Sang-il-
dc.type.journalArticleArticle-
dc.subject.keywordAuthorApproximation algorithms-
dc.subject.keywordAuthorbranch-width-
dc.subject.keywordAuthorclique-width-
dc.subject.keywordAuthorrank-width-
dc.subject.keywordAuthormatroids-
dc.subject.keywordPlusVERTEX-MINORS-
dc.subject.keywordPlusBRANCH-WIDTH-
dc.subject.keywordPlusGRAPHS-
dc.subject.keywordPlusOBSTRUCTIONS-
dc.subject.keywordPlusALGORITHMS-
Appears in Collection
MA-Journal Papers(저널논문)
Files in This Item
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 56 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0