A Fast Max Flow Algorithm

In 2013, Orlin proved that the max flow problem could be solved in O(nm) time. His algorithm was the fastest for very sparse graphs. If the graph was not sufficiently sparse, the fastest running time was an algorithm due to King, Rao, and Tarjan. We describe a new variant of the excess scaling algorithm for the max flow problem whose running time strictly dominates the running time of the algorithm by King, Rao, and Tarjan.


Technical report. MIT Sloan School and Operations Research Center, Cambridge, MA. July, 2018.



View A Fast Max Flow Algorithm