On the complexity of Newmanʼs community finding approach for biological and social networks
Authors:
- 1 February 2013
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 79 (1) , 50-67
Abstract
No abstract availableKeywords
All Related Versions
This publication has 26 references indexed in Scilit:
- Random graph models for directed acyclic networksPhysical Review E, 2009
- Modularity-maximizing graph communities via mathematical programmingThe European Physical Journal B, 2008
- Community Structure in Directed NetworksPhysical Review Letters, 2008
- Resolution limit in community detectionProceedings of the National Academy of Sciences, 2007
- Classes of complex networks defined by role-to-role connectivity profilesNature Physics, 2006
- Finding community structure in networks using the eigenvectors of matricesPhysical Review E, 2006
- Modularity and community structure in networksProceedings of the National Academy of Sciences, 2006
- Scale-free networks in cell biologyJournal of Cell Science, 2005
- Analysis of weighted networksPhysical Review E, 2004
- Hierarchical Organization of Modularity in Metabolic NetworksScience, 2002