Yet another approach to the Maximum Flow
I introduce a new approach to the maximum flow problem by a simple algorithm with a slightly better runtime. This approach is based on sorting arcs insight of vertices on a residual graph. This new approach leads to an O(mn^0.5) time bound for a network with n vertices and m arcs. Category: Algorithms, Graph Theory and maximum flows
cs.DS↗