A hybrid iterated carousel greedy algorithm for community detection in complex networks
Authors:
- Hanzhang KongHKHanzhang Kong
- Qinma KangQKQinma Kang
- Wenquan LiWLWenquan Li
- Chao LiuCLChao Liu
- Yunfan KangYKYunfan Kang
- Hong HeHHHong He
- 1 December 2019
- journal article
- research article
- Published by Elsevier in Physica A: Statistical Mechanics and its Applications
- Vol. 536
Abstract
No abstract availableKeywords
Funding Information
- Shandong Provincial Natural Science Foundation, China (ZR2015AM015)
This publication has 45 references indexed in Scilit:
- Emergence of structural and dynamical properties of ecological mutualistic networksNature, 2013
- Spontaneous synchrony in power-grid networksNature Physics, 2013
- A population-based iterated greedy algorithm for the minimum weight vertex cover problemApplied Soft Computing, 2012
- Iterated tabu search for identifying community structure in complex networksPhysical Review E, 2009
- Clustering complex networks and biological networks by nonnegative matrix factorization with various similarity measuresNeurocomputing, 2008
- Maps of random walks on complex networks reveal community structureProceedings of the National Academy of Sciences of the United States of America, 2008
- Modularity and community structure in networksProceedings of the National Academy of Sciences, 2006
- Comparing community structure identificationJournal of Statistical Mechanics: Theory and Experiment, 2005
- Functional cartography of complex metabolic networksNature, 2005
- Finding community structure in very large networksPhysical Review E, 2004