The maximum-flow problem, or max flow, is one of the most basic problems in computer science. MIT researchers, together with colleagues at Yale and the University of Southern California, have ...

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

This is a preview. Log in through your library . Abstract We consider variants of the max-flow min-cut problems in the plane, motivated by models of damage, where certain sets of edges of the graph ...

Computer scientists at ETH Zurich have written a network flow algorithm that computes almost as fast as is mathematically possible. This algorithm computes the maximum traffic flow with minimum ...

IN this book the author deals with the problem of estimating the maximum flow which may be run off a catchment area during a period of exceptional rainfall. Provision to deal with such maximum flows ...