Extracting Research Communities by Improved Maximum Flow Algorithm.

Toshihiko Horiike Youhei Takahashi Tetsuji Kuboyama Hiroshi Sakamoto

Published in: KES (2) (2009)

Keyphrases

maximum flow
minimum cut
dynamic programming
k means
np hard
segmentation algorithm
clustering method
social networks
search space
ant colony optimization
directed graph
knapsack problem
push relabel