19 citations · 28 across the 4 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2013
Max-Flows on Sparse and Dense Networks
Rahul Mehta
In this paper, we present an improved algorithm for the maximum flow problem on general networks with vertices and arcs. We show how to solve the problem in time, w…
cs.DS2013
A New Push-Relabel Algorithm for Sparse Networks
Rahul Mehta
In this paper, we present a new push-relabel algorithm for the maximum flow problem on flow networks with vertices and arcs. Our algorithm computes a maximum flow in $O(mn)…