1. E.A. Dinic, Algorithm for solution of a problem of maximum flow in a network with power estimation. Soviet Math. Dokl. 11, (1970), 1277–1280
2. S. Even and R.E. Tarjan, Network flow and testing graph connectivity. Siam J. Comp. 4 (1975) 507–518
3. L.R. Ford and D.R. Fulkerson, Flows in networks. Princeton University Press: Princeton, N.J. 1962
4. R.E. Gomory and T.C. Hu, Multi-terminal network flows. J. SIAM. 19, (1961) 551–570
5. A.V. Karzanov, Determining the maximal flow in a network by the method of preflows. Soviet Math. Dokl. 15, (1974), 434–437