Mathematics of Operations Research, Vol. 18, No. 1 (Feb., 1993), pp. 71-97 (27 pages) This paper is concerned with the design and probabilistic analysis of algorithms for the maximum-flow problem and ...

“So it probes the whole graph globally, studying many paths at the same time.” This allowed the new algorithm to solve the max-flow problem substantially faster than previous attempts.