Richard M. Karp, Rajeev Motwani, Noam Nisan, Probabilistic Analysis of Network Flow Algorithms, Mathematics of Operations Research, Vol. 18, No. 1 (Feb., 1993), pp. 71-97 ...

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

Researchers at EPFL and the University of Geneva have developed a new algorithm that cracks an outstanding challenge in ...

Kin's ultra-fast algorithm is considered an important step in dealing with complex, data-intensive network problems that are dynamic and change very rapidly, such as molecular and brain networks ...

A simple network-flow algorithm is described for solving a class of problems, with various applications, including that of project selection. The algorithm should have wide appeal since no prior ...

Researchers have developed a new tool, bimodularity, that adds directionality to community detection in networks.

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

Algorithm promises to greatly streamline solutions to the 'max flow' problem.