{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,30]],"date-time":"2025-08-30T16:30:17Z","timestamp":1756571417821,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319969824"},{"type":"electronic","value":"9783319969831"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-96983-1_49","type":"book-chapter","created":{"date-parts":[[2018,7,31]],"date-time":"2018-07-31T15:50:06Z","timestamp":1533052206000},"page":"688-702","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Distributed Graph Clustering Using Modularity and Map Equation"],"prefix":"10.1007","author":[{"given":"Michael","family":"Hamann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ben","family":"Strasser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dorothea","family":"Wagner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tim","family":"Zeitz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,1]]},"reference":[{"key":"49_CR1","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-1-4614-6170-8","volume-title":"Encyclopedia of Social Network Analysis and Mining","author":"DA Bader","year":"2013","unstructured":"Bader, D.A., Meyerhenke, H., Sanders, P., Schulz, C., Kappes, A., Wagner, D.: Benchmarking for graph clustering and partitioning. In: Rokne, J., Alhajj, R. (eds.) Encyclopedia of Social Network Analysis and Mining, pp. 73\u201382. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-1-4614-6170-8"},{"issue":"3","key":"49_CR2","first-page":"32:1","volume":"11","author":"S Bae","year":"2017","unstructured":"Bae, S., Halperin, D., West, J.D., Rosvall, M., Howe, B.: Scalable and efficient flow-based community detection for large-scale graph analysis. ACM Trans. Knowl. Disc. Data 11(3), 32:1\u201332:30 (2017)","journal-title":"ACM Trans. Knowl. Disc. Data"},{"key":"49_CR3","doi-asserted-by":"crossref","unstructured":"Bae, S., Howe, B.: GossipMap: a distributed community detection algorithm for billion-edge directed graphs. In: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, pp. 27:1\u201327:12. ACM Press (2015)","DOI":"10.1145\/2807591.2807668"},{"key":"49_CR4","doi-asserted-by":"crossref","unstructured":"Bingmann, T., et al.: Thrill: high-performance algorithmic distributed batch data processing with C++. Technical report, arXiv arXiv:1608.05634 (2016)","DOI":"10.1109\/BigData.2016.7840603"},{"issue":"10","key":"49_CR5","doi-asserted-by":"publisher","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"2008","author":"Vincent D Blondel","year":"2008","unstructured":"Blondel, V., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech. Theory Exp. 2008(10) (2008)","journal-title":"Journal of Statistical Mechanics: Theory and Experiment"},{"issue":"2","key":"49_CR6","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1109\/TKDE.2007.190689","volume":"20","author":"U Brandes","year":"2008","unstructured":"Brandes, U., et al.: On modularity clustering. IEEE Trans. Knowl. Data Eng. 20(2), 172\u2013188 (2008)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"49_CR7","doi-asserted-by":"crossref","unstructured":"Buzun, N., et al.: EgoLP: fast and distributed community detection in billion-node social networks. In: Proceedings of the 2014 IEEE International Conference on Data Mining Workshops, pp. 533\u2013540. IEEE Computer Society (2014)","DOI":"10.1109\/ICDMW.2014.158"},{"issue":"3\u20135","key":"49_CR8","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. Phys. Rep. 486(3\u20135), 75\u2013174 (2010)","journal-title":"Phys. Rep."},{"issue":"1","key":"49_CR9","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1073\/pnas.0605965104","volume":"104","author":"S Fortunato","year":"2007","unstructured":"Fortunato, S., Barth\u00e9lemy, M.: Resolution limit in community detection. Proc. Natl. Acad. Sci. U.S.A. 104(1), 36\u201341 (2007)","journal-title":"Proc. Natl. Acad. Sci. U.S.A."},{"key":"49_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.physrep.2016.09.002","volume":"659","author":"S Fortunato","year":"2016","unstructured":"Fortunato, S., Hric, D.: Community detection in networks: a user guide. Phys. Rep. 659, 1\u201344 (2016)","journal-title":"Phys. Rep."},{"key":"49_CR11","doi-asserted-by":"publisher","first-page":"046106","DOI":"10.1103\/PhysRevE.81.046106","volume":"81","author":"BH Good","year":"2010","unstructured":"Good, B.H., de Montjoye, Y.A., Clauset, A.: Performance of modularity maximization in practical contexts. Phys. Rev. E 81, 046106 (2010)","journal-title":"Phys. Rev. E"},{"key":"49_CR12","doi-asserted-by":"crossref","unstructured":"Hamann, M., Meyer, U., Penschuck, M., Wagner, D.: I\/O-efficient generation of massive graphs following the LFR benchmark. In: Proceedings of the 19th Meeting on Algorithm Engineering and Experiments (ALENEX 2017). SIAM (2017)","DOI":"10.1137\/1.9781611974768.5"},{"issue":"1","key":"49_CR13","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF01908075","volume":"2","author":"L Hubert","year":"1985","unstructured":"Hubert, L., Arabie, P.: Comparing partitions. J. Classif. 2(1), 193\u2013218 (1985)","journal-title":"J. Classif."},{"key":"49_CR14","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1006\/jpdc.1997.1403","volume":"48","author":"G Karypis","year":"1998","unstructured":"Karypis, G., Kumar, V.: A parallel algorithm for multilevel graph partitioning and sparse matrix ordering. J. Parallel Distrib. Comput. 48, 71\u201395 (1998)","journal-title":"J. Parallel Distrib. Comput."},{"key":"49_CR15","doi-asserted-by":"publisher","first-page":"012809","DOI":"10.1103\/PhysRevE.91.012809","volume":"91","author":"T Kawamoto","year":"2015","unstructured":"Kawamoto, T., Rosvall, M.: Estimating the resolution limit of the map equation in community detection. Phys. Rev. E 91, 012809 (2015)","journal-title":"Phys. Rev. E"},{"issue":"4","key":"49_CR16","doi-asserted-by":"publisher","first-page":"046110","DOI":"10.1103\/PhysRevE.78.046110","volume":"78","author":"A Lancichinetti","year":"2008","unstructured":"Lancichinetti, A., Fortunato, S., Radicchi, F.: Benchmark graphs for testing community detection algorithms. Phys. Rev. E 78(4), 046110 (2008)","journal-title":"Phys. Rev. E"},{"key":"49_CR17","unstructured":"Leskovec, J., Krevl, A.: SNAP datasets: stanford large network dataset collection, June 2014. http:\/\/snap.stanford.edu\/data"},{"key":"49_CR18","doi-asserted-by":"crossref","unstructured":"Ling, X., Yang, J., Wang, D., Chen, J., Li, L.: Fast community detection in large weighted networks using graphx in the cloud. In: 18th IEEE International Conference on High Performance Computing and Communications, pp. 1\u20138. IEEE (2016)","DOI":"10.1109\/HPCC-SmartCity-DSS.2016.0012"},{"issue":"026113","key":"49_CR19","first-page":"1","volume":"69","author":"MEJ Newman","year":"2004","unstructured":"Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E 69(026113), 1\u201316 (2004)","journal-title":"Phys. Rev. E"},{"key":"49_CR20","doi-asserted-by":"crossref","unstructured":"Que, X., Checconi, F., Petrini, F., Gunnels, J.A.: Scalable community detection with the louvain algorithm. In: 29th International Parallel and Distributed Processing Symposium (IPDPS 2015), pp. 28\u201337. IEEE Computer Society (2015)","DOI":"10.1109\/IPDPS.2015.59"},{"issue":"1","key":"49_CR21","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 Eur. Phys. J. Spec. Top. 178(1), 13\u201323 (2009)","journal-title":"The Eur. Phys. J. Spec. Top."},{"issue":"1","key":"49_CR22","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1109\/TPDS.2015.2390633","volume":"27","author":"C Staudt","year":"2016","unstructured":"Staudt, C., Meyerhenke, H.: Engineering parallel algorithms for community detection in massive networks. IEEE Trans. Parallel Distrib. Syst. 27(1), 171\u2013184 (2016)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"49_CR23","doi-asserted-by":"crossref","unstructured":"Wickramaarachchi, C., Frincu, M., Small, P., Prasanna, V.K.: Fast parallel algorithm for unfolding of communities in large graphs. In: Proceedings of the 2014 IEEE High Performance Extreme Computing Conference, pp. 1\u20136. IEEE (2014)","DOI":"10.1109\/HPEC.2014.7040973"},{"key":"49_CR24","unstructured":"Zeitz, T.: Engineering distributed graph clustering using MapReduce. Master\u2019s thesis, Karlsruhe Institute of Technology (2017)"},{"key":"49_CR25","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.parco.2016.05.008","volume":"58","author":"J Zeng","year":"2016","unstructured":"Zeng, J., Yu, H.: A study of graph partitioning schemes for parallel graph community detection. Parallel Comput. 58, 131\u2013139 (2016)","journal-title":"Parallel Comput."}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2018: Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-96983-1_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T01:09:30Z","timestamp":1659316170000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-96983-1_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319969824","9783319969831"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-96983-1_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"1 August 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Euro-Par","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Turin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"europar2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/europar2018.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}