| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4624917 | Advances in Applied Mathematics | 2013 | 25 Pages |
Abstract
In an earlier paper with Whittle, we showed that there is a tree that displays, up to a natural equivalence, all non-trivial 3-separations of a 3-connected matroid M. The purpose of this paper is to give a polynomial-time algorithm for constructing such a tree for M.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
