Researchers from IIT Bombay propose a computationally efficient, network theory-based mathematical framework to test decentralised traffic control systems.

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

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

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

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

As summer winds down, many of us in continental Europe are heading back north. The long return journeys from the beaches of ...

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