A MapReduce-Based Maximum-Flow Algorithm for Large Small-World Network Graphs.

Felix Halim Roland H. C. Yap Yongzheng Wu

Published in: ICDCS (2011)

Keyphrases

maximum flow
directed graph
theoretical analysis
optimal solution
k means
computational complexity
data clustering
polynomial time complexity
clustering algorithm
bipartite graph
shortest path problem
push relabel