1. L. R. Ford and D. R. Fulkerson, Flows in Networks, Princeton Univ. Press, Princeton, NJ (1962).
2. J. Edmonds and R. M. Karp, “Theoretical improvements in algorithmic efficiency for network flow problems,” J. ACM,19, No. 2, 248–264 (1972).
3. E. A. Dinits, “Algorithm to solve the maximum network flow problem with a power bound,” Dokl. Akad. Nauk SSSR,194, No. 4, 754–757 (1970).
4. A. V. Karzanov, “Finding the maximum network flow by the preflow method,” Dokl. Akad. Nauk SSSR,215, 49–52 (1974).
5. A. V. Goldberg and R. E. Tarjan, “A new approach to maximum flow problem,” J. ACM,35, 921–940 (1988).