The European PRACE organization has published a series of excellent whitepapers on scalable algorithms. Produced as part of the Work Package 8 of the PRACE 1IP Project, the most recent paper is ...

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

To tackle the problem, researchers have traditionally used a maximum-flow algorithm, also known as “max flow,” in which a network is represented as a graph with a series of nodes, known as ...

New Algorithm from MIT, Yale, and USC Tackles Max Flow Challenge By Dian Schaffhauser 01/09/14 Researchers from MIT, Yale University, and the University of Southern California have developed what they ...

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

Week 1 Intro to algorithm design: stable marriage Week 2 Shortest path algorithms Week 3 Minimal cycle ratio algorithms Week 4-5 Maximal flow algorithms Week 6-8 Min-cost flow algorithms Week 9-10 ...

Ahuja, R. K., Goldberg, A. V., Orlin, J. B., and Tarjan, R. E. (1988). Finding Minimum-Cost Flows by Double Scaling. Technical Report CS-TR-164-88, Department of ...

To tackle the problem, researchers have traditionally used a maximum-flow algorithm, also known as "max flow," in which a network is represented as a graph with a series of nodes, known as ...