Matching: A Well-Solved Class of Integer Linear Programs
- 30 January 2003
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Maximum matching and a polyhedron with 0,1-verticesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- Modification of Edmonds' maximum matching algorithmJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965
- The Factors of GraphsCanadian Journal of Mathematics, 1952
- The Factorization of Linear GraphsJournal of the London Mathematical Society, 1947