1. J. Edmonds and R. M. Karp,Theoretical improvements in algorithmic efficiency for network flow problems, JACM 19:2 (April 1972), 248–264.
2. L. R. Ford, Jr. and D. R. Fulkerson,Flows in Networks, Princeton University Press, (1962), 53–55.
3. L. R. Kerr,The effect of algebraic structure on the computational complexity of matrix multiplication, (Ph.D. thesis), Cornell Univ., June 1970.
4. J. Munkres,Algorithms for the assignment and transportation problems, J. SIAM 5:1 (March 1957), 32–38.
5. R. Silver,An algorithm for the assignment problem, Comm. ACM 3:11, (Nov. 1960), 605–606.