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 ...

Network slowdowns could soon be a thing of the past, thanks to a superfast new algorithm. The breakthrough offers a dramatically faster solution to a problem that has been plaguing computer scientists ...

In many actual network flow situations, nodes as well as arcs have limited capacities. This paper presents, for such a network, an algorithm for maximizing flow from a source node to a sink node. The ...