An O(V 5/3 E 2/3) algorithm for the maximal flow problem

Summary A new algorithm for finding a maximal flow in a given network is presented. The algorithm runs in time O(V ^5/3 E ^2/3), where V and E are the number of the vertices and edges in the network. We use the notation A = 0(B) [A = Ω(B)] for A ≦ cB [A ≧ cB], and A = θ(B) for c ₁ B≦A ≦ c ₂ B where c, c ₁and c ₂are positive constants. (The same constants for all the occurrences of this notation)