4R K Ahuja, J B Orlin. A fast and simple algorithm for the maximum flow problem. Oper Res, 1989, 37(5) : 748~759.
5R K Ahuja, J B Orlin, R E Tarjan. Improved time bounds for the maximum flow problem. SIAM J Computing, 1989, 18(5): 939-954.
6N Alon. Generating pseudo-random permutations and maximum flow algorithms. Information Processing Letters, 1990, 35 ( 4 ) :201-203.
7V King, S Rao, R Tarjan. A faster deterministic maximum flow algorithm. J Algorithms, 1994, 17(3): 447~474.
8J Cheriyan, T Hagerup, K Mehlhom. An O( n^3)-time maximum flow algorithm. SIAMJ Computing, 1996, 25(6): 1144~1170.
9H N Gabow. Scaling algorithms for network problems. J Comput System Sci, 1985, 31(2): 148-168.
10R K Ahuja, J B Orlin. Distance-directed augmenting path algorithms for the maximum flow problem. Naval Research Logisties Quarterlv. 1991. 38(2): 413~430.