Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, s-t Shortest Path, and Minimum-Cost Flow. Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024 DOI ...

The new algorithm solves these two problems in “almost linear” time, which means that the algorithm’s runtime is roughly proportional to the amount of time it takes merely to write down the details of ...

Like a Porsche racing a horse-drawn carriage The ETH Zurich researchers have thus developed what is, in theory, the fastest possible network flow algorithm. Two years ago, Kyng and his team ...

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