1 paper
Fang Wu, Bernardo A. Huberman
We present a method that allows for the discovery of communities within graphs of arbitrary size in times that scale linearly with their size. This method avoids edge cutting and i…