A New Push-Relabel Algorithm for the Maximum Flow Problem.

Published in: CoRR (2013)

Keyphrases

maximum flow
push relabel
computational complexity
np hard
optimal solution
k means
dynamic programming
segmentation algorithm
clustering method
minimum cut
social networks
graphical models
ant colony optimization
tree structure
shortest path problem