{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T16:56:16Z","timestamp":1763830576559},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,10,15]],"date-time":"2013-10-15T00:00:00Z","timestamp":1381795200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1007\/s10878-013-9665-1","type":"journal-article","created":{"date-parts":[[2013,10,14]],"date-time":"2013-10-14T11:57:43Z","timestamp":1381751863000},"page":"747-767","source":"Crossref","is-referenced-by-count":8,"title":["A near-optimal adaptive algorithm for maximizing modularity in dynamic scale-free networks"],"prefix":"10.1007","volume":"30","author":[{"given":"Thang N.","family":"Dinh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nam P.","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Md Abdul","family":"Alim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"My T.","family":"Thai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,10,15]]},"reference":[{"key":"9665_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal G, Kempe D (2008) Modularity-maximizing graph communities via mathematical programming. Eur Phys J B 66:409\u2013418","DOI":"10.1140\/epjb\/e2008-00425-1"},{"key":"9665_CR2","doi-asserted-by":"crossref","unstructured":"Aiello W, Chung F, Lu L (2000) A random graph model for massive graphs. In: STOC \u201900. ACM, New York, NY, USA","DOI":"10.1145\/335305.335326"},{"key":"9665_CR3","doi-asserted-by":"crossref","unstructured":"Aiello W, Chung F, Lu L (2001) Random evolution in massive graphs. In: Handbook of massive data sets. Kluwer Academic Publishers, Norwell","DOI":"10.1109\/SFCS.2001.959927"},{"key":"9665_CR4","doi-asserted-by":"crossref","unstructured":"Albert R, Jeong H, Barabasi A (2000) Error and attack tolerance of complex networks. Nature 406:378\u2013482","DOI":"10.1038\/35019019"},{"key":"9665_CR5","doi-asserted-by":"crossref","unstructured":"Bansal N, Blum A, Chawla S (2002) Correlation clustering. In: Annual IEEE symposium on foundations of computer science (FOCS), vol 0, p 238. doi: 10.1109\/SFCS.2002.1181947","DOI":"10.1109\/SFCS.2002.1181947"},{"key":"9665_CR6","doi-asserted-by":"crossref","unstructured":"Barabasi A, Albert R, Jeong H (2000) Scale-free characteristics of random networks: the topology of the world-wide web. Phys A 281:69\u201377","DOI":"10.1016\/S0378-4371(00)00018-2"},{"key":"9665_CR7","doi-asserted-by":"crossref","unstructured":"Barabasi AL, Jeong H, Nda Z, Ravasz E, Schubert A, Vicsek T (2002) Evolution of the social network of scientific collaborations. Phys A 311:590\u2013614","DOI":"10.1016\/S0378-4371(02)00736-7"},{"key":"9665_CR8","doi-asserted-by":"crossref","unstructured":"Bianconi G, Barabasi AL (2001) Competition and multiscaling in evolving networks. EPL (Europhysics Letters) 54(4):436. http:\/\/stacks.iop.org\/0295-5075\/54\/i=4\/a=436","DOI":"10.1209\/epl\/i2001-00260-6"},{"key":"9665_CR9","doi-asserted-by":"crossref","unstructured":"Blondel VD, Guillaume JL, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. J Stat Mech Theory Exp 2008(10):P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"9665_CR10","doi-asserted-by":"crossref","unstructured":"Brandes U, Delling D, Gaertler M, Gorke R, Hoefer M, Nikoloski Z, Wagner D (2008) On modularity clustering. IEEE Trans Knowl Data Eng 20(2):172\u2013188","DOI":"10.1109\/TKDE.2007.190689"},{"key":"9665_CR11","doi-asserted-by":"crossref","unstructured":"Clauset A, Newman MEJ, Moore C (2004) Finding community structure in very large networks. Phys Rev E 70(6):066111","DOI":"10.1103\/PhysRevE.70.066111"},{"key":"9665_CR12","doi-asserted-by":"crossref","unstructured":"DasGupta, B, Desai D (2012) On the complexity of newman\u2019s community finding approach for biological and social networks. J Comput Syst Sci 79(1):50\u201367. doi: 10.1016\/j.jcss.2012.04.003","DOI":"10.1016\/j.jcss.2012.04.003"},{"key":"9665_CR13","unstructured":"Data A (2003) www.cs.cornell.edu\/projects\/kddcup\/datasets.html . KDD Cup 2003"},{"key":"9665_CR14","doi-asserted-by":"crossref","unstructured":"Dinh TN, Thai MT (2011) Finding community structure with performance guarantees in scale-free networks. In: SocialCom\/PASSAT, pp 888\u2013891","DOI":"10.1109\/PASSAT\/SocialCom.2011.185"},{"key":"9665_CR15","doi-asserted-by":"crossref","unstructured":"Dinh TN, Xuan Y, Thai MT (2009) Towards social-aware routing in dynamic communication networks. IPCCC","DOI":"10.1109\/PCCC.2009.5403845"},{"key":"9665_CR16","doi-asserted-by":"crossref","unstructured":"Faloutsos M, Faloutsos P, Faloutsos C (1999) On power-law relationships of the internet topology. In: Proceedings of the conference on applications, technologies, architectures, and protocols for computer communication, SIGCOMM \u201999, pp 251\u2013262. ACM, New York, NY, USA. doi: 10.1145\/316188.316229","DOI":"10.1145\/316188.316229"},{"key":"9665_CR17","unstructured":"Ferrante A (2006) Hardness and approximation algorithms of some graph problems"},{"key":"9665_CR18","doi-asserted-by":"crossref","unstructured":"Fortunato S, Barthelemy M (2007) Resolution limit in community detection. Proc Natl Acad Sci USA 104(1):36\u201341","DOI":"10.1073\/pnas.0605965104"},{"key":"9665_CR19","doi-asserted-by":"crossref","unstructured":"Giotis I, Guruswami V (2006) Correlation clustering with a fixed number of clusters. Theory Comput 2(1):249\u2013266. doi: 10.4086\/toc.2006.v002a013","DOI":"10.4086\/toc.2006.v002a013"},{"key":"9665_CR20","doi-asserted-by":"crossref","unstructured":"Good BH, de Montjoye YA, Clauset A (2010) Performance of modularity maximization in practical contexts. Phys Rev E 81, 046,106. doi: 10.1103\/PhysRevE.81.046106","DOI":"10.1103\/PhysRevE.81.046106"},{"key":"9665_CR21","doi-asserted-by":"crossref","unstructured":"Hui P, Crowcroft J, Yoneki E (2011) Bubble rap: social-based forwarding in delay-tolerant networks. IEEE Trans Mobile Comput 10(11):1576\u20131589. doi: 10.1109\/TMC.2010.246","DOI":"10.1109\/TMC.2010.246"},{"key":"9665_CR22","doi-asserted-by":"crossref","unstructured":"Lancichinetti A, Fortunato S (2009) Community detection algorithms: a comparative analysis. Phys Rev E 80(5), 056117. doi: 10.1103\/PhysRevE.80.056117","DOI":"10.1103\/PhysRevE.80.056117"},{"key":"9665_CR23","doi-asserted-by":"crossref","unstructured":"Lancichinetti A, Radicchi F, Ramasco JJ, Fortunato S (2011) Finding statistically significant communities in networks. PLoS ONE 6, e17249","DOI":"10.1371\/journal.pone.0018961"},{"key":"9665_CR24","doi-asserted-by":"crossref","unstructured":"Lin Y, Chi Y, Zhu S, Sundaram H, Tseng BL, Facetnet: a framework for analyzing communities and their evolutions in dynamic networks. WWW (2008)","DOI":"10.1145\/1367497.1367590"},{"issue":"2","key":"9665_CR25","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"MEJ Newman","year":"2003","unstructured":"Newman MEJ (2003) The structure and function of complex networks. SIAM Rev 45(2):167\u2013256","journal-title":"SIAM Rev"},{"key":"9665_CR26","doi-asserted-by":"crossref","unstructured":"Newman MEJ (2006) Modularity and community structure in networks. Proc Natl Acad Sci USA 103(23):8577\u20138582","DOI":"10.1073\/pnas.0601602103"},{"key":"9665_CR27","doi-asserted-by":"crossref","unstructured":"Nguyen N, Dinh T, Xuan Y, Thai M (2011) Adaptive algorithms for detecting community structure in dynamic social networks. In: INFOCOM, 2011 Proceedings IEEE, pp 2282\u20132290. doi: 10.1109\/INFCOM.2011.5935045","DOI":"10.1109\/INFCOM.2011.5935045"},{"key":"9665_CR28","doi-asserted-by":"crossref","unstructured":"Noack A (2009) Modularity clustering is force-directed layout. Phys Rev E 79, 026,102. doi: 10.1103\/PhysRevE.79.026102","DOI":"10.1103\/PhysRevE.79.026102"},{"key":"9665_CR29","doi-asserted-by":"crossref","unstructured":"P\u00e1sztor B, Mottola L, Mascolo C, Picco G, Ellwood S, Macdonald D (2010) Selective reprogramming of mobile sensor networks through social community detection. In: Proceedings of EWSN, vol 5970, pp 178\u2013193. Springer, Berlin","DOI":"10.1007\/978-3-642-11917-0_12"},{"key":"9665_CR30","doi-asserted-by":"crossref","unstructured":"Tantipathananandh C, Berger-Wolf T (2009) Constant-factor approximation algorithms for identifying dynamic communities. In: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD \u201909. ACM, New York, NY, USA, pp 827\u2013836. doi: 10.1145\/1557019.1557110 .","DOI":"10.1145\/1557019.1557110"},{"key":"9665_CR31","doi-asserted-by":"crossref","unstructured":"Viswanath B, Mislove A, Cha M, Gummadi KP (2009) On the evolution of user interaction in facebook. In: 2nd ACM SIGCOMM Workshop on Social Networks","DOI":"10.1145\/1592665.1592675"},{"key":"9665_CR32","doi-asserted-by":"crossref","unstructured":"Yu H, Kaminsky M, Gibbons PB, Flaxman A (2006) Sybilguard: defending against sybil attacks via social networks. In: Proceedings of the ACM SIGCOMM 2006 conference, SIGCOMM \u201906, pp 267\u2013278. ACM, New York, NY, USA. doi: 10.1145\/1159913.1159945 .","DOI":"10.1145\/1159913.1159945"},{"key":"9665_CR33","doi-asserted-by":"crossref","unstructured":"Zhu Z, Cao G, Zhu S, Ranjan S, Nucci A (2009) A social network based patching scheme for worm containment in cellular networks. In: INFOCOM 2009, IEEE, pp 1476\u20131484. doi: 10.1109\/INFCOM.2009.5062064 .","DOI":"10.1109\/INFCOM.2009.5062064"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9665-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-013-9665-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9665-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:21Z","timestamp":1559276601000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-013-9665-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,15]]},"references-count":33,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,10]]}},"alternative-id":["9665"],"URL":"https:\/\/doi.org\/10.1007\/s10878-013-9665-1","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10,15]]}}}