{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T11:45:59Z","timestamp":1771847159171,"version":"3.50.1"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,3,30]],"date-time":"2023-03-30T00:00:00Z","timestamp":1680134400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,3,30]],"date-time":"2023-03-30T00:00:00Z","timestamp":1680134400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Comput. Sci. Technol."],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1007\/s11390-023-1599-1","type":"journal-article","created":{"date-parts":[[2023,6,21]],"date-time":"2023-06-21T08:02:55Z","timestamp":1687334575000},"page":"373-390","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Isolate Sets Based Parallel Louvain Method for Community Detection"],"prefix":"10.1007","volume":"38","author":[{"given":"Hang","family":"Qie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"Dou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhen","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yun-Sheng","family":"Xiong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,30]]},"reference":[{"issue":"3\/4\/5","key":"1599_CR1","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato S. Community detection in graphs. Physics Reports, 2010, 486(3\/4\/5): 75\u2013174. DOI: https:\/\/doi.org\/10.1016\/j.physrep.2009.11.002.","journal-title":"Physics Reports"},{"issue":"6","key":"1599_CR2","doi-asserted-by":"publisher","first-page":"066111","DOI":"10.1103\/PhysRevE.70.066111","volume":"70","author":"A Clauset","year":"2004","unstructured":"Clauset A, Newman M E J, Moore C. Finding community structure in very large networks. Physical Review E, 2004, 70(6): 066111. DOI: https:\/\/doi.org\/10.1103\/PhysRevE.70.066111.","journal-title":"Physical Review E"},{"key":"1599_CR3","doi-asserted-by":"publisher","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"2008","author":"VD Blondel","year":"2008","unstructured":"Blondel V D, Guillaume J L, Lambiotte R, Lefebvre E. Fast unfolding of communities in large networks. Journal of Statistical Mechanics, 2008, 2008: P10008. DOI: https:\/\/doi.org\/10.1088\/1742-5468\/2008\/10\/P10008.","journal-title":"Journal of Statistical Mechanics"},{"key":"1599_CR4","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.parco.2015.03.003","volume":"47","author":"H Lu","year":"2015","unstructured":"Lu H, Halappanavar M, Kalyanaraman A. Parallel heuristics for scalable community detection. Parallel Computing, 2015, 47: 19\u201337. DOI: https:\/\/doi.org\/10.1016\/j.parco.2015.03.003.","journal-title":"Parallel Computing"},{"key":"1599_CR5","doi-asserted-by":"crossref","unstructured":"Que X Y, Checconi F, Petrini F, Gunnels J A. Scalable community detection with the Louvain algorithm. In Proc. the 29th IEEE International Parallel and Distributed Processing Symposium, May 2015, pp.28\u201337. DOI: 10.1109\/IPDPS.2015.59.","DOI":"10.1109\/IPDPS.2015.59"},{"issue":"1","key":"1599_CR6","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1109\/TPDS.2015.2390633","volume":"27","author":"CL Staudt","year":"2016","unstructured":"Staudt C L, Meyerhenke H. Engineering parallel algorithms for community detection in massive networks. IEEE Trans. Parallel and Distributed Systems, 2016, 27(1): 171\u2013184. DOI: https:\/\/doi.org\/10.1109\/TPDS.2015.2390633.","journal-title":"IEEE Trans. Parallel and Distributed Systems"},{"key":"1599_CR7","doi-asserted-by":"crossref","unstructured":"Forster R. Louvain community detection with parallel heuristics on GPUs. In Proc. the 20th IEEE Jubilee International Conference on Intelligent Engineering Systems, Jun. 30\u2013Jul. 2, 2016, pp.227\u2013232. DOI: 10.1109\/INES.2016.7555126.","DOI":"10.1109\/INES.2016.7555126"},{"key":"1599_CR8","doi-asserted-by":"crossref","unstructured":"Naim M, Manne F, Halappanavar M, Tumeo A. Community detection on the GPU. In Proc. the 2017 IEEE International Parallel and Distributed Processing Symposium, May 29\u2013Jun. 2, 2017, pp.625\u2013634. DOI: 10.1109\/IPDPS.2017.16.","DOI":"10.1109\/IPDPS.2017.16"},{"key":"1599_CR9","doi-asserted-by":"crossref","unstructured":"Zeng J P, Yu H F. A scalable distributed Louvain algorithm for large-scale graph community detection. In Proc. the 2018 IEEE International Conference on Cluster Computing, Sept. 2018, pp.268\u2013278. DOI: 10.1109\/CLUSTER.2018.00044.","DOI":"10.1109\/CLUSTER.2018.00044"},{"key":"1599_CR10","doi-asserted-by":"crossref","unstructured":"Ghosh S, Halappanavar M, Tumeo A, Kalyanaraman A, Lu H, Chavarri\u00e0-Miranda D, Khan A, Gebremedhin A. Distributed Louvain algorithm for graph community detection. In Proc. the 2018 IEEE International Parallel and Distributed Processing Symposium, May 2018, pp.885\u2013895. DOI: 10.1109\/IPDPS.2018.00098.","DOI":"10.1109\/IPDPS.2018.00098"},{"key":"1599_CR11","doi-asserted-by":"publisher","unstructured":"Zeng J P, Yu H F. Parallel modularity-based community detection on large-scale graphs. In Proc. the 2015 IEEE International Conference on Cluster Computing, Sept. 2015. DOI: https:\/\/doi.org\/10.1109\/CLUSTER.2015.11.","DOI":"10.1109\/CLUSTER.2015.11"},{"key":"1599_CR12","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/S1571-0661(04)81015-6","volume":"78","author":"W Duckworth","year":"2003","unstructured":"Duckworth W, Zito M. Large 2-independent sets of regular graphs. Electronic Notes in Theoretical Computer Science, 2003, 78: 223\u2013235. DOI: https:\/\/doi.org\/10.1016\/S1571-0661(04)81015-6.","journal-title":"Electronic Notes in Theoretical Computer Science"},{"issue":"1","key":"1599_CR13","doi-asserted-by":"publisher","first-page":"151","DOI":"10.7151\/dmgt.1398","volume":"28","author":"M Blidia","year":"2008","unstructured":"Blidia M, Chellali M, Favaron O, Meddah N. Maximal kindependent sets in graphs. Discussiones Mathematicae Graph Theory, 2008, 28(1): 151\u2013163. DOI: https:\/\/doi.org\/10.7151\/dmgt.1398.","journal-title":"Discussiones Mathematicae Graph Theory"},{"issue":"5","key":"1599_CR14","doi-asserted-by":"publisher","first-page":"1152","DOI":"10.1007\/s11390-019-1966-0","volume":"34","author":"DW Wang","year":"2019","unstructured":"Wang D W, Cui W Q, Qin B. CK-modes clustering algorithm based on node cohesion in labeled property graph. Journal of Computer Science and Technology, 2019, 34(5): 1152\u20131166. DOI: https:\/\/doi.org\/10.1007\/s11390-019-1966-0.","journal-title":"Journal of Computer Science and Technology"},{"issue":"5","key":"1599_CR15","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1007\/s11390-015-1585-3","volume":"30","author":"W Yang","year":"2015","unstructured":"Yang W, Shen G W, Wang W, Gong L Y, Yu M, Dong G Z. Anomaly detection in microblogging via co-clustering. Journal of Computer Science and Technology, 2015, 30(5): 1097\u20131108. DOI: https:\/\/doi.org\/10.1007\/s11390-015-1585-3.","journal-title":"Journal of Computer Science and Technology"},{"issue":"4","key":"1599_CR16","doi-asserted-by":"publisher","first-page":"1118","DOI":"10.1073\/pnas.0706851105","volume":"105","author":"M Rosvall","year":"2008","unstructured":"Rosvall M, Bergstrom C T. Maps of random walks on complex networks reveal community structure. Proceedings of the National Academy of Sciences of the United States of America, 2008, 105(4): 1118\u20131123. DOI: https:\/\/doi.org\/10.1073\/pnas.0706851105.","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"},{"issue":"1","key":"1599_CR17","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1140\/epjst\/e2010-01179-1","volume":"178","author":"M Rosvall","year":"2009","unstructured":"Rosvall M, Axelsson D, Bergstrom C T. The map equation. The European Physical Journal Special Topics, 2009, 178(1): 13\u201323. DOI: https:\/\/doi.org\/10.1140\/epjst\/e2010-01179-1.","journal-title":"The European Physical Journal Special Topics"},{"issue":"2","key":"1599_CR18","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"BW Kernighan","year":"1970","unstructured":"Kernighan B W, Lin S. An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal, 1970, 49(2): 291\u2013307. DOI: https:\/\/doi.org\/10.1002\/j.1538-7305.1970.tb01770.x.","journal-title":"The Bell System Technical Journal"},{"key":"1599_CR19","unstructured":"MacQueen J. Some methods for classification and analysis of multivariate observations. In Proc. the 5th Berkeley Symposium on Mathematical Statistics and Probability, Le Cam L M, Neyman J (eds.), Statistical Laboratory of the University of California, 1967, pp.407."},{"issue":"4","key":"1599_CR20","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1137\/0603056","volume":"3","author":"ER Barnes","year":"1982","unstructured":"Barnes E R. An algorithm for partitioning the nodes of avgraph. SIAM Journal on Algebraic Discrete Methods,1982, 3(4): 541\u2013550. DOI: https:\/\/doi.org\/10.1137\/0603056.","journal-title":"SIAM Journal on Algebraic Discrete Methods"},{"issue":"12","key":"1599_CR21","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan M, Newman M E J. Community structure in social and biological networks. Proceedings of the National Academy of Sciences of the United States of America, 2002, 99(12): 7821\u20137826. DOI: https:\/\/doi.org\/10.1073\/pnas.122653799.","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"},{"key":"1599_CR22","doi-asserted-by":"crossref","unstructured":"Flake G W, Lawrence S, Lee Giles C. Efficient identification of Web communities. In Proc. the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Aug. 2000, pp.150\u2013160. DOI: 10.1145\/347090.347121.","DOI":"10.1145\/347090.347121"},{"issue":"3","key":"1599_CR23","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1109\/2.989932","volume":"35","author":"GW Flake","year":"2002","unstructured":"Flake G W, Lawrence S, Giles C L, Coetzee F M. Self-organization and identification of Web communities. Computer, 2002, 35(3): 66\u201370. DOI: https:\/\/doi.org\/10.1109\/2.989932.","journal-title":"Computer"},{"key":"1599_CR24","doi-asserted-by":"publisher","first-page":"1981","DOI":"10.5555\/1390681.1442798","volume":"9","author":"EM Airoldi","year":"2008","unstructured":"Airoldi E M, Blei D M, Fienberg S E, Xing E P. Mixed membership stochastic blockmodels. The Journal of Machine Learning Research, 2008, 9: 1981\u20132014. DOI: https:\/\/doi.org\/10.5555\/1390681.1442798.","journal-title":"The Journal of Machine Learning Research"},{"key":"1599_CR25","unstructured":"Mehta N, Carin L, Rai P. Stochastic blockmodels meet graph neural networks. arXiv: 1905.05738, 2019. https:\/\/arxiv.org\/abs\/1905.05738, May 2019."},{"issue":"36","key":"1599_CR26","doi-asserted-by":"publisher","first-page":"14534","DOI":"10.1073\/pnas.1221839110","volume":"110","author":"PK Gopalan","year":"2013","unstructured":"Gopalan P K, Blei D M. Efficient discovery of overlapping communities in massive networks. Proceedings of the National Academy of Sciences of the United States of America, 2013, 110(36): 14534\u201314539. DOI: https:\/\/doi.org\/10.1073\/pnas.1221839110.","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"},{"key":"1599_CR27","doi-asserted-by":"crossref","unstructured":"Cheong C Y, Huynh H P, Lo D, Goh R S M. Hierarchical parallel algorithm for modularity-based community detection using GPUs. In Proc. the 19th European Conference on Parallel Processing, Aug. 2013, pp.775\u2013787. DOI: 10.1007\/978-3-642-40047-6_77.","DOI":"10.1007\/978-3-642-40047-6_77"},{"key":"1599_CR28","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.micpro.2017.08.002","volume":"54","author":"M Fazlali","year":"2017","unstructured":"Fazlali M, Moradi E, Malazi H T. Adaptive parallel Louvain community detection on a multicore platform. Microprocessors and Microsystems, 2017, 54: 26\u201334. DOI: https:\/\/doi.org\/10.1016\/j.micpro.2017.08.002.","journal-title":"Microprocessors and Microsystems"},{"key":"1599_CR29","doi-asserted-by":"publisher","unstructured":"Wickramaarachchi C, Frincu M, Small P, Prasanna V K. Fast parallel algorithm for unfolding of communities in large graphs. In Proc. the 2014 IEEE High Performance Extreme Computing Conference, Sept. 2014. DOI: https:\/\/doi.org\/10.1109\/HPEC.2014.7040973.","DOI":"10.1109\/HPEC.2014.7040973"},{"key":"1599_CR30","doi-asserted-by":"crossref","unstructured":"Kunegis J. KONECT: The Koblenz network collection. In Proc. the 22nd International Conference on World Wide Web, May 2013, pp.1343\u20131350. DOI: 10.1145\/2487788.2488173.","DOI":"10.1145\/2487788.2488173"},{"key":"1599_CR31","doi-asserted-by":"crossref","unstructured":"Boldi P, Rosa M, Santini M, Vigna S. Layered label propagation: A multiresolution coordinate-free ordering for compressing social networks. In Proc. the 20th International Conference on World Wide Web, Mar. 2011, pp.587\u2013596. DOI: 10.1145\/1963405.1963488.","DOI":"10.1145\/1963405.1963488"}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-023-1599-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11390-023-1599-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-023-1599-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,21]],"date-time":"2023-06-21T08:28:00Z","timestamp":1687336080000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11390-023-1599-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,30]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["1599"],"URL":"https:\/\/doi.org\/10.1007\/s11390-023-1599-1","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,30]]},"assertion":[{"value":"20 May 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 February 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 March 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}