58 citations · 58 across the 1 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
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)…
cs.DS2007★ 165 cited
Efficient modularity optimization by multistep greedy algorithm and vertex mover refinement
Philipp Schuetz, Amedeo Caflisch
Identifying strongly connected substructures in large networks provides insight into their coarse-grained organization. Several approaches based on the optimization of a quality fu…