165 citations · 223 across the 3 of their papers we have counts for
3 papers
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…
q-bio.BM2004
The protein folding network
Francesco Rao, Amedeo Caflisch
The conformation space of a 20-residue antiparallel -sheet peptide, sampled by molecular dynamics simulations, is mapped to a network. Conformations are nodes of the network, an…