Push–relabel maximum flow algorithm
Practical implementations

While the generic push–relabel algorithm has O (V E) time complexity, efficient implementations achieve O (V) or lower time complexity by enforcing appropriate rules in selecting applicable push and relabel operations. The empirical performance can be further improved by heuristics.
punctuation:no_comma, length_constraints:number_words[152]