• Admin
    UC Research Repository
    View Item 
       
    • UC Home
    • Library
    • UC Research Repository
    • College of Engineering
    • Engineering: Journal Articles
    • View Item
       
    • UC Home
    • Library
    • UC Research Repository
    • College of Engineering
    • Engineering: Journal Articles
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of the RepositoryCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    Statistics

    View Usage Statistics

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

    Thumbnail
    View/Open
    Embargoed until 01-03-2016 (510.8Kb)
    Author
    Brettell, N.
    Semple, C.
    Date
    2015
    Permanent Link
    http://hdl.handle.net/10092/11740

    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.

    Subjects
    k-connected matroid
     
    Tree decomposition
     
    k-tree
     
    k-separation
     
    Field of Research::01 - Mathematical Sciences::0101 - Pure Mathematics::010101 - Algebra and Number Theory
    Collections
    • Engineering: Journal Articles [1124]
    Rights
    https://hdl.handle.net/10092/17651

    UC Research Repository
    University Library
    University of Canterbury
    Private Bag 4800
    Christchurch 8140

    Phone
    364 2987 ext 8718

    Email
    ucresearchrepository@canterbury.ac.nz

    Follow us
    FacebookTwitterYoutube

    © University of Canterbury Library
    Send Feedback | Contact Us