1. R.K. Ahuja and J.B. Orlin, “A fast and simple algorithm for the maximum flow problem,”Operations Research 37 (1989) 939–954.
2. R.K. Ahuja, J.B. Orlin and R.E. Tarjan, “Improved time bounds for the maximum flow problem,”SIAM Journal on Computing 18 (1989) 939–954.
3. unpublished working paper;D.P. Bertsekas,1979
4. D.P. Bertsekas, “Distributed asynchronous relaxation methods for linear network flow problems,” Technical Report LIDS-P-1606, Laboratory for Information and Decision Sciences, M.I.T. (Cambridge, MA, 1986).
5. E.A. Dinic, “Algorithm for solution of a problem of maximum flow in networks with power estimation,”Soviet Mathematics Doklady 11 (1970) 1277–1280.