[1] B. V., Cherkassky and A. V., Goldberg. “On Implementing Push-Relabel Method for the Maximum Flow Problem.” Algorithmica, 19:390–410, 1997.Google Scholar

[2] E. A., Dinic. “Algorithm for Solution of a Problem of Maximum Flow in Networks with Power Estimation.” Soviet Math. Dokl., 11:1277–1280, 1970.Google Scholar

[3] Yefim Dinitz., Dinitz'Algorithm: The original version and Even's version. In Oded, Goldreich, Arnold L., Rosenberg, and Alan L., Selman, editors, Essays in Memory of Shimon Even, Vol. 3895 of Lecture Notes in Computer Science, pp. 218–240. Springer, 2006.Google Scholar

[4] J., Edmonds and R. M., Karp. “Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems.” J. Assoc. Comput. Mach., 19:248–264, 1972.Google Scholar

[5] S., Even and R. E., Tarjan. “Network Flow and Testing Graph Connectivity.” SIAM J. Comput., 4:507–518, 1975.Google Scholar

[6] L. R., Ford Jr., and D. R., Fulkerson. “Maximal Flow Through a Network.” Canadian Journal of Math., 8:399–404, 1956.Google Scholar

[7] L. R., Ford Jr., and D. R., Fulkerson. Flows in Networks. Princeton University Press, 1962.Google Scholar

[8] A. V., Goldberg and S., Rao. “Beyond the Flow Decomposition Barrier.” J. Assoc. Comput. Mach., 45:753–782, 1998.Google Scholar

[9] A. V., Goldberg and R. E., Tarjan. “A New Approach to the Maximum Flow Problem.” J. Assoc. Comput. Mach., 35:921–940, 1988.Google Scholar

[10] A. V., Goldberg and R. E., Tarjan. “Finding Minimum-Cost Circulations by Successive Approximation.” Math. of OR, 15:430–466, 1990.Google Scholar

[11] A. V., Karzanov. “O nakhozhdenii maksimal' nogo potoka v setyakh spetsial' nogo vida i nekotorykh prilozheniyakh.” In Matematicheskie Voprosy Upravleniya Proizvodstvom, volume 5. Moscow State University Press, 1973. In Russian; title translation: “On Finding Maximum Flows in Networks with Special Structure and Some Applications.”Google Scholar

[12] A. V., Karzanov. “Determining the Maximal Flow in a Network by the Method of Preflows.” Soviet Math. Dok., 15:434–437, 1974.Google Scholar

[13] V., King, S., Rao, and R., Tarjan. “A Faster Deterministic Maximum Flow Algorithm.” J. Algorithms, 17:447–474, 1994.Google Scholar

[14] D. D., Sleator and R. E., Tarjan. “A Data Structure for Dynamic Trees.” J. Comput. System Sci., 26:362–391, 1983.Google Scholar