most citedEfficient modularity optimization by multistep greedy algorithm and vertex mover refinement

165 citations · 223 across the 2 of their papers we have counts for

collaborators

1 paper

cs.DS2008★ 58 cited

Multistep greedy algorithm identifies community structure in real-world and computer-generated networks

Philipp Schuetz, Amedeo Caflisch

We have recently introduced a multistep extension of the greedy algorithm for modularity optimization. The extension is based on the idea that merging l pairs of communities (l>1)…