An algorithm for constructing a k-tree for a k-connected matroid

dc.contributor.author	Brettell, N.
dc.contributor.author	Semple, C.
dc.date.accessioned	2016-01-31T23:10:56Z
dc.date.available	2016-01-31T23:10:56Z
dc.date.issued	2015	en
dc.description.abstract	For a k-connected matroid M, Clark and Whittle showed there is a tree that displays, up to a natural equivalence, all non-trivial k-separations of M. In this paper, we present an algorithm for con- structing such a tree, and prove that, provided the rank of any subset of E(M) can be found in constant time, the algorithm runs in polynomial time in jE(M)j.	en
dc.identifier.citation	Brettell, N., Semple, C. (2015) An algorithm for constructing a k-tree for a k-connected matroid. Annals of Combinatorics, 19(1), pp. 29-78.	en
dc.identifier.doi	https://doi.org/10.1007/s00026-015-0258-9
dc.identifier.uri	http://hdl.handle.net/10092/11740
dc.language.iso	en
dc.publisher	University of Canterbury. Mathematics and Statistics	en
dc.rights.uri	https://hdl.handle.net/10092/17651
dc.subject	k-connected matroid	en
dc.subject	Tree decomposition	en
dc.subject	k-tree	en
dc.subject	k-separation	en
dc.subject.anzsrc	Fields of Research::49 - Mathematical sciences::4904 - Pure mathematics::490401 - Algebra and number theory	en
dc.title	An algorithm for constructing a k-tree for a k-connected matroid	en
dc.type	Journal Article

Now showing 1 - 1 of 1