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 ...
A team of computer scientists has come up with a dramatically faster algorithm for one of the oldest problems in computer science: maximum flow. The problem asks how much material can flow through a ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback