Matroid intersection algorithms
- 1 December 1975
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 9 (1) , 31-56
- https://doi.org/10.1007/bf01681329
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- A matroid generalization of a theorem of Mendelsohn and DulmageDiscrete Mathematics, 1973
- Matroids and the greedy algorithmMathematical Programming, 1971
- On Matroid Theorems of Edmonds and RadoJournal of the London Mathematical Society, 1970
- 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