Previous max-flow algorithms have come at the problem one edge, or path, at a time, Kelner says.

The new algorithm is “absurdly fast,” said Daniel Spielman of Yale University. “I was actually inclined to believe … algorithms this good for this problem would not exist.” Maximum flow has been ...

Researchers have devised an "absurdly fast" algorithm to solve the problem of finding the fastest flow through a network.

This algorithm solves the minimum-cost maximum-flow problem for networks that incrementally change as new connections are added. Furthermore, in a second paper accepted by the IEEE Symposium on ...

The algorithm developed by Kelner and his four colleagues chooses to solve the max-flow problem by analyzing all potential paths at the same time.

A souped-up algorithm for solving the max flow problem could help find the best paths for moving goods across countries or routing information on the internet ...

Previous max-flow algorithms have come at the problem one edge, or path, at a time, Kelner says. So for example, when sending items from node A to node B, the algorithms would transmit some of the ...

Computer scientists have written a network flow algorithm that computes almost as fast as is mathematically possible. This algorithm computes the maximum traffic flow with minimum transport costs ...