## An $$O(IVI^3)$$ algorithm for finding maximum flows in networks.(English)Zbl 0391.90041

### MSC:

 90B10 Deterministic network models in operations research 68Q25 Analysis of algorithms and problem complexity 05C99 Graph theory 65K05 Numerical mathematical programming methods

### Keywords:

Algorithm; Maximum Flows in Networks; Blocking Flows

Zbl 0219.90046
Full Text:

### References:

 [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, NJ · Zbl 0139.13701 [6] Galil, Z., A new algorithm for maximal flow problem: preliminary version, (1978), 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
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.