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

Researchers develop fastest possible flow algorithm Date: June 28, 2024 Source: ETH Zurich Summary: Computer scientists have written a network flow algorithm that computes almost as fast as is ...

Previous maximum flow algorithms made steady and incremental advances, but they still took longer to find the optimal flow than to process the network data. But the new research, presented on June ...

Kin's algorithm can quickly calculate the optimal transportation flow for all kinds of networks, including not only the transportation of goods by rail and road, but also water and the Internet.

That kind of network is called a directed acyclic graph ... Shortest-paths problems are a special case of minimum-cost flow, so the new minimum-cost-flow algorithm could also be used to solve the ...

Horn found that the literature on traffic flow instabilities had proposed a range of values for all those variables, and within those ranges, his algorithm works very efficiently. But in fact ...

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