Keywords
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
DasGupta B Desai D (2013) On the complexity of Newman’s community finding approach for biological and social networks. J Comput Syst Sci 79:50–67
Dinh TN, Thai MT (2013) Community detection in scale-free networks: approximation algorithms for maximizing modularity. IEEE J Sel Areas Commun Spec Issue Netw Sci (JSAC) 31(6):997–1006
Dinh TN, Thai MT (2014) Towards optimal community detection: from trees to general weighted networks. Internet Math. doi:10.1080/15427951.2014.950875
Dinh TN, Nguyen NP, Alim MA, Thai MT (2013) A near-optimal adaptive algorithm for maximizing modularity in dynamic scale-free networks. J Comb Optim (JOCO). doi:10.1007/s10878-013-9665-1
Fortunato S (2010) Community detection in graphs. Phys Rep 486(3-5):75-174
Fortunato S Barthelemy M (2007) Resolution limit in community detection. Proc Natl Acad Sci 104(1):36-41
Newman MEJ (2006) Modularity and community structure in networks. Proc Natl Acad Sci 103:8577–8582
Nguyen NP, Dinh TN, Tokala S, Thai MT (2011) Overlapping communities in dynamic networks: their detection and mobile applications. In: Proceedings of ACM international conference on mobile computing and networking (MobiCom), Las Vegas
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media New York
About this entry
Cite this entry
Thai, M.T. (2016). Modularity Maximization in Complex Networks. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_614
Download citation
DOI: https://doi.org/10.1007/978-1-4939-2864-4_614
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4939-2863-7
Online ISBN: 978-1-4939-2864-4
eBook Packages: Computer ScienceReference Module Computer Science and Engineering