An augmenting path algorithm for linear matroid parity
- 1 June 1986
- journal article
- Published by Springer Nature in Combinatorica
- Vol. 6 (2) , 123-150
- https://doi.org/10.1007/bf02579169
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Efficient algorithms for graphic matroid intersection and parityPublished by Springer Nature ,2005
- A linear-time algorithm for a special case of disjoint set unionJournal of Computer and System Sciences, 1985
- Efficient algorithms for a family of matroid intersection problemsJournal of Algorithms, 1984
- Data Structures and Network AlgorithmsPublished by Society for Industrial & Applied Mathematics (SIAM) ,1983
- On the Asymptotic Complexity of Matrix MultiplicationSIAM Journal on Computing, 1982
- Complexity of Matroid Property AlgorithmsSIAM Journal on Computing, 1982
- Combinatorial TheoryPublished by Springer Nature ,1979
- Decomposing symmetric exchanges in matroid basesMathematical Programming, 1976
- An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on GraphsJournal of the ACM, 1976
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965