Solving non-bipartite matching problems via shortest path techniques
- 1 December 1988
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 13 (1) , 225-261
- https://doi.org/10.1007/bf02288324
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- On the use of optimal fractional matchings for solving the (integer) matching problemComputing, 1986
- Solving large‐scale matching problems efficiently: A new primal matching approachNetworks, 1986
- An analysis of alternative strategies for implementing matching algorithmsNetworks, 1983
- A shortest augmenting path method for solving minimal perfect matching problemsNetworks, 1981
- Assignment and Matching Problems: Solution Methods with FORTRAN-ProgramsPublished by Springer Nature ,1980
- A primal algorithm for optimum matchingPublished by Springer Nature ,1978
- Maximum matching and a polyhedron with 0,1-verticesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- TWO THEOREMS IN GRAPH THEORYProceedings of the National Academy of Sciences, 1957