An o(n³)-Time Algorithm Maximum-Flow Algorithm.

Joseph Cheriyan Torben Hagerup Kurt Mehlhorn

Published in: SIAM J. Comput. (1996)

Keyphrases

maximum flow
dynamic programming
np hard
k means
learning algorithm
state space
knapsack problem
minimum cut
computer vision
image processing
computational complexity
segmentation algorithm
tree structure
combinatorial optimization
allocation strategy