DC Field | Value | Language |
---|---|---|
dc.contributor.author | Oum, Sang-il | ko |
dc.contributor.author | Seymour, P | ko |
dc.date.accessioned | 2013-03-06T07:27:32Z | - |
dc.date.available | 2013-03-06T07:27:32Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 2007-05 | - |
dc.identifier.citation | JOURNAL OF COMBINATORIAL THEORY SERIES B, v.97, no.3, pp.385 - 393 | - |
dc.identifier.issn | 0095-8956 | - |
dc.identifier.uri | http://hdl.handle.net/10203/86276 | - |
dc.description.abstract | An integer-valued function f on the set 2(V) of all subsets of a finite set V is a connectivity function if it satisfies the following conditions: (1) f (X) + f(Y) >= f (X n Y) + f (X u Y) for all subsets X, Y of V, (2) f (X) = f (V \ X) for all X subset of V, and (3) f (theta) = 0. Branch-width is defined for graphs, matroids, and more generally, connectivity functions. We show that for each constant k, there is a polynomial-time (in vertical bar V vertical bar) algorithm to decide whether the branch-width of a connectivity function f is at most k, if f is given by an oracle. This algorithm can be applied to branch-width, carving-width, and rank-width of graphs. In particular, we can recognize matroids Mu of branch-width at most k in polynomial (in vertical bar E(M)vertical bar) time if the matroid is given by an independence oracle. (c) 2006 Elsevier Inc. All rights reserved. | - |
dc.language | English | - |
dc.publisher | ACADEMIC PRESS INC ELSEVIER SCIENCE | - |
dc.subject | MINIMIZING SUBMODULAR FUNCTIONS | - |
dc.subject | ALGORITHM | - |
dc.subject | TIME | - |
dc.title | Testing branch-width | - |
dc.type | Article | - |
dc.identifier.wosid | 000245791600007 | - |
dc.identifier.scopusid | 2-s2.0-33847679508 | - |
dc.type.rims | ART | - |
dc.citation.volume | 97 | - |
dc.citation.issue | 3 | - |
dc.citation.beginningpage | 385 | - |
dc.citation.endingpage | 393 | - |
dc.citation.publicationname | JOURNAL OF COMBINATORIAL THEORY SERIES B | - |
dc.identifier.doi | 10.1016/j.jctb.2006.06.006 | - |
dc.contributor.localauthor | Oum, Sang-il | - |
dc.contributor.nonIdAuthor | Seymour, P | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | branch-width | - |
dc.subject.keywordAuthor | tangle | - |
dc.subject.keywordAuthor | connectivity function | - |
dc.subject.keywordAuthor | symmetric submodular function | - |
dc.subject.keywordAuthor | rank-width | - |
dc.subject.keywordAuthor | carving-width | - |
dc.subject.keywordPlus | MINIMIZING SUBMODULAR FUNCTIONS | - |
dc.subject.keywordPlus | ALGORITHM | - |
dc.subject.keywordPlus | TIME | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.