GIGAZINE

An algorithm that can calculate the maximum transport flow at the lowest cost and the fastest speed for all kinds of networks such as railroads, roads, and electricity has been ...

A team of researchers led by Rasmus Kinn of the Swiss Federal Institute of Technology in Zurich has created a near-perfect algorithm to calculate the maximum transport flows at the lowest cost in any ...

Algorithms, not GPUs, are the real force multipliers and this Infosys Prize winner proves it

Sachdeva’s breakthrough challenges one of the most studied problems in computer science, known as maximum flow, which ...
NextBigFuture

MIT, Yale and USC have a better max-flow algorithm which improve networks and logistics

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

Experiences with Parallel Multi-threaded Network Maximum Flow Algorithm

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