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

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

COMP_SCI 457: Advanced Algorithms VIEW ALL COURSE TIMES AND SESSIONS Prerequisites COMP_SCI 336 or any algorithms course Description CATALOG DESCRIPTION: Design and analysis of advanced algorithms: ...

On the 19th of February 2025, M.Sc. Andreas Grigorjew defends his PhD thesis on Algorithms and Graph Structures for Splitting Network Flows, in Theory and Practice. The thesis is related to research ...

To tackle the problem, researchers have traditionally used a maximum-flow algorithm, also known as "max flow," in which a network is represented as a graph with a series of nodes, known as ...

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