Back to Search
Start Over
Constructing a 3-tree for a 3-connected matroid
- Source :
-
Advances in Applied Mathematics . Jan2013, Vol. 50 Issue 1, p176-200. 25p. - Publication Year :
- 2013
-
Abstract
- 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. [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 01968858
- Volume :
- 50
- Issue :
- 1
- Database :
- Academic Search Index
- Journal :
- Advances in Applied Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 83576874
- Full Text :
- https://doi.org/10.1016/j.aam.2011.09.007