Two-Level Push-Relabel Algorithm for the Maximum Flow Problem.

Andrew V. Goldberg

Published in: AAIM (2009)

Keyphrases

maximum flow
push relabel
minimum cut
worst case
objective function
computational complexity
graph cuts
segmentation algorithm
max flow
clustering algorithm
k means
global optimization
greedy heuristic
simplex algorithm