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 ...
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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback