| [1] |
Cherkasky, B. V., Algorithm of construction of maximal flow in networks with complexity of \(O(|V|^2·|E|^{12}\) operations, Math. Methods of Solution of Econ. Problems, 7, 117-125 (1977) |
| [2] |
Dinic, E. A., Algorithm for solution of a problem of maximum flow in a network with power estimation, Soviet Math. Dokl., 11, 1277-1280 (1970) · Zbl 0219.90046 |
| [3] |
Even, S., The max flow algorithm of Dinic and Karzanov: An exposition, MIT Laboratory for Computer Science Technical Report No. MIT/LCS/TM-80 (1976) |
| [4] |
Even, S.; Tarjan, R. E., Network flow and testing graph connectivity, SIAM J. Comput., 4, 507-518 (1975) · Zbl 0328.90031 |
| [5] |
Ford, L. R.; Fulkerson, D. R., Flows in Networks (1962), Princeton University Press: Princeton University Press Princeton, NJ · Zbl 0139.13701 |
| [6] |
Galil, Z., A new algorithm for maximal flow problem: preliminary version (1978), Dept. of Mathematical Sciences, Tel-Aviv University: Dept. of Mathematical Sciences, Tel-Aviv University Tel-Aviv, Israel |
| [7] |
Karzanov, A. V., Determining the maximal flow in a network by the method of preflows, Soviet Math. Dokl., 15, 434-437 (1974) · Zbl 0303.90014 |
