A polynomial time algorithm to find the minimum cycle basis of a regular matroid

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2368, Issue , 2002, Pages 200-209

  Golynski, Alexander ^a   Horton, Joseph D ^a  

^a UNIVERSITY OF NEW BRUNSWICK   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; DOMAIN DECOMPOSITION METHODS; POLYNOMIAL APPROXIMATION; TREES (MATHEMATICS);

COGRAPHIC MATROIDS; DECOMPOSITION THEOREMS; FAST MATRIX MULTIPLICATION; M-MATRICES; MINIMUM CYCLE BASIS; POLYNOMIAL-TIME ALGORITHMS; REGULAR MATROID;

ALGORITHMS;

EID: 84943264759     PISSN: 03029743     EISSN: 16113349     Source Type: Journal    
DOI: 10.1007/3-540-45471-3_21     Document Type: Article

References (10)

1. T. Coleman and A. Pothen. The null space problem I. Complexity. SIAM Journal of Algebraic Discrete Methods, 7, 1986.
2. D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. In Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, 1987.
3. R. E. Gomory and T. C. Hu. Multi-terminal network flows. Journal of the Society for Industrial and Applied Mathematics, 9(4):551-570, 1961.
4. A. Golynski. A polynomial time algorithm to find the minimum cycle basis of a regular matroid. Master’s thesis, University of New Brunswick, 2002.
5. A. Goldberg and S. Rao. Beyond the flow decomposition barrier. Journal of the ACM, 45(5):783-797, 1998.
6. J. D. Horton. A polynomial-time algorithm to find the shortest cycle basis of a graph. SIAM Journal on Computing, 16(2):358-366, 1 1987.
7. P. Seymour. Decomposition of regular matroids. Journal of Combinatorial Theory (B), 1980.
8. K. Truemper. A decomposition theory for matroids.V. Testing of matrix total unimodularity. Journal of Combinatorial Theory (B), 1990.
9. K. Truemper. Matroid Decomposition. Academic Press, Boston, 1992.
10. W. Tutte. Lectures on matroids. J. Res. Nat. Bur. Standards Sect. B, 69B:1-47, 1965.