1. Adel’son-Vel’sky, G.M., Landis, E.M.: An algorithm for the organization of information. Soviet Mathematics Doklady 3, 1259–1263 (1962)
2. Ford, L.R., Fulkerson, D.R.: Flows in networks. Princeton University Press, Princeton (1962)
3. Arlazarov, V.L., Dinic, E.A., Kronrod, M.A., Faradjev, I.A.: On economical finding of transitive closure of a graph. Doklady Akademii Nauk SSSR 194 (3) (1970) (in Russian); English transl.: Soviet Mathematics Doklady 11, 1270– 1272 (1970)
4. Dinic, E.A.: An algorithm for the solution of the max-flow problem with the polynomial estimation. Doklady Akademii Nauk SSSR 194(4) (1970) (in Russian); English transl.: Soviet Mathematics Doklady 11, 1277–1280 (1970)
5. Edmonds, J., Karp, R.M.: Theoretical improvements in algorithmic efficiency for network flow problems. J. of ACM 19, 248–264 (1972)