A New Push-Relabel Algorithm for the Maximum Flow Problem

In this paper, we present a faster push-relabel algorithm for the maximum flow problem on bounded-degree networks with n vertices and m arcs. We show how to compute a maximum flow in O(mn) time. This matches the results of Orlin’s algorithm, which runs in O(mn + m log n) time on general networks (and O(mn) time on bounded-degree networks). Our main result… (More)