A fast maximum flow algorithm

James B. Orlin, Xiao-Yue Gong

Abstract: In 2013, Orlin proved that the max flow problem could be solved in O(nm) time. His algorithm ran in O(nm + m1.94) time, which was the fastest for graphs with fewer than n1.06 arcs. If the graph was n...