1. R.K. Ahuja, T.L. Magnanti and J.B. Orlin,Network Flows: Theory, Algorithms, and Applications (Prentice Hall, Englewood Cliffs, NJ, 1993).
2. R.K. Ahuja and J.B. Orlin, A fast and simple algorithm for the maximum flow problem,Operations Research 37 (1989) 748–759.
3. R.D. Armstrong and Z. Jin, A strongly polynomial dual (simplex) method for the max flow problem, Manuscript, Graduate School of Management, Rutgers University, Newark, NJ (1992).
4. A.V. Goldberg, A new max-flow algorithm, Technical Report MIT/LCS/ TM 291, Laboratory for Computer Science, MIT, Cambridge, MA (1985).
5. A.V. Goldberg, M.D. Grigoriadis and R.E. Tarjan, Use of dynamic trees in a network simplex algorithm for the maximum flow problem,Mathematical Programming 50 (1991) 277–290.