A distributed algorithm for maximum flow on processor-arrays.

Kenji Onaga Satoshi Marumoto

Published in: Systems and Computers in Japan (1986)

Keyphrases

maximum flow
dynamic programming
probabilistic model
linear programming
segmentation algorithm
optimal solution
np hard
clustering method
knapsack problem
minimum cut
image processing
objective function
k means
min cut max flow
push relabel