EAMCD: an efficient algorithm based on minimum coupling distance for community identification in complex networks
Authors:
- 21 January 2013
- journal article
- Published by Springer Nature in The European Physical Journal B
- Vol. 86 (1) , 14
Abstract
No abstract availableKeywords
This publication has 35 references indexed in Scilit:
- Identifying and evaluating community structure in complex networksPattern Recognition Letters, 2010
- Predicting missing links via local informationThe European Physical Journal B, 2009
- Quantitative function for community detectionPhysical Review E, 2008
- Maps of random walks on complex networks reveal community structureProceedings of the National Academy of Sciences, 2008
- An information-theoretic framework for resolving community structure in complex networksProceedings of the National Academy of Sciences, 2007
- Modularity and community structure in networksProceedings of the National Academy of Sciences, 2006
- Local modularity measure for network clusterizationsPhysical Review E, 2005
- Community detection in complex networks using extremal optimizationPhysical Review E, 2005
- Finding community structure in very large networksPhysical Review E, 2004
- Finding communities in linear time: a physics approachThe European Physical Journal B, 2004