Show simple item record

dc.contributor.authorHliněný, Petr
dc.date.accessioned2006-09-25T13:09:37Z
dc.date.available2006-09-25T13:09:37Z
dc.date.issued2005
dc.identifier.citationSIAM Journal on Computing. 2005, vol. 35, issue 2, p. 259-277.en
dc.identifier.issn0097-5397
dc.identifier.issn1095-7111
dc.identifier.urihttp://hdl.handle.net/10084/56507
dc.description.abstractBranch-width is a structural parameter very closely related to tree-width, but branch-width has an immediate generalization from graphs to matroids. We present an algorithm that, for a given matroid M of bounded branch-width t which is represented over a finite field, finds a branch decomposition of M of width at most 3t in cubic time. Then we show that the branch-width of M is a uniformly fixed-parameter tractable problem. Other applications include recognition of matroid properties definable in the monadic second-order logic for bounded branch-width, and [S.-I. Oum, Approximating rank-width and clique-width quickly, in Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science, Springer-Verlag, Heidelberg, to appear] a cubic time approximation algorithm for graph rank-width and clique-width. (A correction to this article has been appended to the pdf file.)en
dc.language.isoenen
dc.publisherSociety for Industrial and Applied Mathematicsen
dc.relation.ispartofseriesSIAM Journal on Computingen
dc.relation.urihttps://doi.org/10.1137/S0097539702418589en
dc.subjectrepresentable matroiden
dc.subjectparametrized algorithmen
dc.subjectbranch-widthen
dc.subjectrank-widthen
dc.titleA parametrized algorithm for matroid branch-widthen
dc.typearticleen
dc.identifier.locationNení ve fondu ÚKen
dc.identifier.doi10.1137/S0097539702418589
dc.identifier.wos000233930200001


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record