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.

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

A recent study published in the International Journal of Computer Networks and Applications (Vol. 11, No. 3, 2024) introduces ...

We develop several algorithms for the simple equal flow problem-the network simplex algorithm, the parametric simplex algorithm, the combinatorial parametric algorithm, the binary search algorithm, ...

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

We propose a new class of algorithms for linear cost network flow problems with and without gains. These algorithms are based on iterative improvement of a dual cost and operate in a manner that is ...

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

New research suggests that current algorithms to represent networks have not truly considered the complex inter-dependencies in data, which can lead to erroneous analysis or predictions ...