Efficient modularity optimization by multistep greedy algorithm and vertex mover refinement

Identifying strongly connected substructures in large networks provides insight into their coarse-grained organization. Several approaches based on the optimization of a quality function, e.g., the modularity, have been proposed. We present here a multistep extension of the greedy algorithm (MSG) th...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Physical review. E, Statistical, nonlinear, and soft matter physics Statistical, nonlinear, and soft matter physics, 2008-04, Vol.77 (4 Pt 2), p.046112-046112, Article 046112
Hauptverfasser:	Schuetz, Philipp, Caflisch, Amedeo
Format:	Artikel
Sprache:	eng
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!