On the Complexity of Preflow-Push Algorithms for Maximum-Flow Problems.

Published in: Algorithmica (1994)

Keyphrases

maximum flow
push relabel
minimum cut
optimization problems
computational complexity
worst case
space complexity
computer vision
higher order
combinatorial optimization
np complete
directed graph
knapsack problem