Improved Bounds for Matroid Partition and Intersection Algorithms
- 1 November 1986
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 15 (4) , 948-957
- https://doi.org/10.1137/0215066
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Efficient algorithms for graphic matroid intersection and parityPublished by Springer Nature ,2005
- Finding feasible vectors of Edmonds-Giles polyhedraJournal of Combinatorial Theory, Series B, 1984
- Testing membership in matroid polyhedraJournal of Combinatorial Theory, Series B, 1984
- Computing Maximal “Polymatroidal” Network FlowsMathematics of Operations Research, 1982
- Matroid IntersectionAnnals of Discrete Mathematics, 1979
- Matroid intersection algorithmsMathematical Programming, 1975
- Network Flow and Testing Graph ConnectivitySIAM Journal on Computing, 1975
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973
- Transversals and matroid partitionJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- Minimum partition of a matroid into independent subsetsJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965