References
- EDMONDS , J. , 1965 , Paths, trees and flowers . Canadian Journal of Mathematics , 17 , 449 – 467 .
- EvEN , S. , and KARIV , O. , 1975 , On O(n2–5) algorithm for maximum matching in general graphs . Proceedings of 16th Ann. Symp. on Foundations of Computer Science , IEEE , New York , pp. 100 – 112 .
- HOPCROFT , J. , and KARP , R. M. , 1973 , A n5/2 algorithm for maximum matchings in bipartite graphs . SIAM Journal of Computing , 2 , 225 – 231 .
- GABOW , H. , 1976 , An efficient implementation of Edmonds algorithm for maximum matching on graphs . Journal of ACM , 23 , 221 – 234 .
- GERSHONI , H. , and RUDY , N. , 1981 , An analysis of the total variation of work measurement techniques . International Journal of Production Research , 19 , 303 – 316 .