A Fast Max Flow Algorithm

James B. Orlin, Xiao-Yue Gong

In 2013, Orlin proved that the max flow problem could be solved in $O(nm)$ time. His algorithm ran in $O(nm+m^{1.94})$ time, which was the fastest for graphs with fewer than $n^{…