{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T02:20:00Z","timestamp":1743042000393,"version":"3.40.3"},"publisher-location":"New York, NY","reference-count":45,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9781493971305"},{"type":"electronic","value":"9781493971312"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/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-1-4939-7131-2_23","type":"book-chapter","created":{"date-parts":[[2018,6,11]],"date-time":"2018-06-11T19:21:36Z","timestamp":1528744896000},"page":"161-171","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Benchmarking for Graph Clustering and Partitioning"],"prefix":"10.1007","author":[{"given":"David A.","family":"Bader","sequence":"first","affiliation":[]},{"given":"Andrea","family":"Kappes","sequence":"additional","affiliation":[]},{"given":"Henning","family":"Meyerhenke","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Sanders","sequence":"additional","affiliation":[]},{"given":"Christian","family":"Schulz","sequence":"additional","affiliation":[]},{"given":"Dorothea","family":"Wagner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,6,12]]},"reference":[{"issue":"1","key":"23_CR2100","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1080\/10586458.2001.10504428","volume":"10","author":"W Aiello","year":"2001","unstructured":"Aiello W, Chung F, Lu L (2001) A random graph model for power law graphs. Exp Math 10(1):53\u201366","journal-title":"Exp Math"},{"issue":"1","key":"23_CR2101","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s10766-015-0389-y","volume":"45","author":"M Alam","year":"2017","unstructured":"Alam M, Khan M (2017) Parallel algorithms for generating random networks with given degree sequences. Int J Parallel Prog 45(1):109\u2013127","journal-title":"Int J Parallel Prog"},{"issue":"1","key":"23_CR2102","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R Albert","year":"2002","unstructured":"Albert R, Barab\u00e1si AL (2002) Statistical mechanics of complex networks. Rev Mod Phys 74(1):47","journal-title":"Rev Mod Phys"},{"key":"23_CR2103","doi-asserted-by":"crossref","unstructured":"Aloise D, Caporossi G, Perron S, Hansen P, Liberti L, Ruiz M (2012) Modularity maximization in networks by variable neighborhood search. In: Proceedings of graph partitioning and graph clustering, 10th DIMACS implementation challenge workshop, 2012. Contemporary mathematics, vol 588. American Mathematical Society","DOI":"10.1090\/conm\/588\/11705"},{"key":"23_CR2104","unstructured":"Arenas A. Network data sets. http:\/\/deim.urv.cat\/~aarenas\/data\/welcome.htm. Online. Accessed 28 Sept 2012"},{"key":"23_CR2105","unstructured":"Bader DA, Berry J, Kahan S, Murphy R, Jason Riedy E, Will-cock J (2010) Graph 500 benchmark 1 (\u201csearch\u201d), version 1.1. Technical report, Graph 500"},{"key":"23_CR2106","unstructured":"Bader D, Meyerhenke H, Sanders P, Wagner D (2012) 10th DIMACS implementation challenge. http:\/\/www.cc.gatech.edu\/dimacs10\/. Online. Accessed 17 Apr 2016"},{"key":"23_CR2107","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A-L Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si A-L, Albert R (1999) Emergence of scaling in random networks. Science 286:509\u2013512","journal-title":"Science"},{"key":"23_CR2108","doi-asserted-by":"crossref","unstructured":"Bauer R, Delling D, Sanders P, Schieferdecker D, Schultes D, Wagner D (2010) Combining hierarchical and goal-directed speed-up techniques for Dijkstra\u2019s algorithm. ACM J Exp Algorithmics 152.3:2.1\u20132.3:2.31","DOI":"10.1145\/1671970.1671976"},{"key":"23_CR2109","doi-asserted-by":"publisher","first-page":"056119","DOI":"10.1103\/PhysRevE.83.056119","volume":"83","author":"JW Berry","year":"2011","unstructured":"Berry JW, Hendrickson B, LaViolette RA, Phillips CA (2011) Tolerating the community detection resolution limit with edge weighting. Phys Rev E 83:056119","journal-title":"Phys Rev E"},{"key":"23_CR2110","volume-title":"Random graphs","author":"B Bollob\u00e1s","year":"1985","unstructured":"Bollob\u00e1s B (1985) Random graphs. Academic Press, London"},{"key":"23_CR2111","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/BFb0030098","volume-title":"Parallel Algorithms for Irregularly Structured Problems","author":"\u00dcmit V. \u00c7ataly\u00fcrek","year":"1996","unstructured":"\u00c7ataly\u00fcrek \u00dcV, Aykanat C (1996) Decomposing irregularly sparse matrices for parallel matrix-vector multiplication. In: Ferreira A, Rolim J, Saad Y, Yang T (eds) Parallel algorithms for irregularly structured problems. Lecture notes in computer science, vol 1117. Springer, Berlin\/Heidelberg, pp 75\u201386. https:\/\/doi.org\/10.1007\/BFb0030098"},{"key":"23_CR2112","doi-asserted-by":"crossref","unstructured":"\u00c7ataly\u00fcrek \u00dcV, Kaya K, Langguth J, Ucar B (2012) A divisive clustering technique for maximizing the modularity. In: Proceedings of graph partitioning and graph clustering, 10th DIMACS implementation challenge workshop, 2012. Contemporary mathematics, vol 588. American Mathematical Society","DOI":"10.1090\/conm\/588\/11712"},{"key":"23_CR2113","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1137\/1.9781611972740.43","volume-title":"Proceedings of the 2004 SIAM International Conference on Data Mining","author":"Deepayan Chakrabarti","year":"2004","unstructured":"Chakrabarti D, Zhan Y, Faloutsos C (2004) R-MAT: A recursive model for graph mining. In: Proceedings of the 4th SIAM international conference on Data Mining (SDM), Orlando. SIAM"},{"key":"23_CR2114","unstructured":"Davis T (2016) The University of Florida Sparse Matrix Collection. http:\/\/www.cise.ufl.edu\/ research\/sparse\/matrices. Online. Accessed 17 Apr2016"},{"key":"23_CR2115","unstructured":"van Dongen SM (2000) Graph clustering by flow simulation. PhD thesis, University of Utrecht"},{"key":"23_CR2116","unstructured":"Dorogovtsev SN, Mendes JFF (2003) Evolution of networks: from biological nets to the internet and WWW. Oxford University Press, Oxford"},{"key":"23_CR2117","doi-asserted-by":"crossref","unstructured":"Fagginger Auer BO, Bisseling RH (2012) Graph coarsening and clustering on the GPU. In: Proceedings of graph partitioning and graph clustering, 10th DIMACS implementation challenge workshop, 2012. Contemporary mathematics, vol 588. American Mathematical Society","DOI":"10.1090\/conm\/588\/11706"},{"key":"23_CR2118","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1073\/pnas.0605965104","volume":"104","author":"S Fortunato","year":"2007","unstructured":"Fortunato S, Barthelemy M (2007) Resolution limit in community detection. Proc Natl Acad Sci 104:36\u201341","journal-title":"Proc Natl Acad Sci"},{"issue":"4","key":"23_CR2119","doi-asserted-by":"publisher","first-page":"1141","DOI":"10.1214\/aoms\/1177706098","volume":"30","author":"H Gilbert","year":"1959","unstructured":"Gilbert H (1959) Random graphs. Ann Math Stat 30(4):1141\u20131144","journal-title":"Ann Math Stat"},{"key":"23_CR2120","doi-asserted-by":"publisher","first-page":"046106","DOI":"10.1103\/PhysRevE.81.046106","volume":"81","author":"BH Good","year":"2010","unstructured":"Good BH, de Montjoye Y-A, Clauset A (2010) Performance of modularity maximization in practical contexts. Phys Rev E 81:046106","journal-title":"Phys Rev E"},{"key":"23_CR2121","doi-asserted-by":"crossref","unstructured":"Holtgrewe M, Sanders P, Schulz C (2010) Engineering a Scalable High Quality Graph Partitioner. In: 24th IEEE international parallal and distributed processing symposium, 2010","DOI":"10.1109\/IPDPS.2010.5470485"},{"issue":"3","key":"23_CR2122","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1145\/990308.990313","volume":"51","author":"R Kannan","year":"2004","unstructured":"Kannan R, Vempala S, Vetta A (2004) On clusterings: good, bad, spectral. J ACM 51(3):497\u2013515","journal-title":"J ACM"},{"key":"23_CR2123","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G Karypis","year":"1999","unstructured":"Karypis G, Kumar V (1999) A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J Sci Comput 20:359\u2013392","journal-title":"SIAM J Sci Comput"},{"key":"23_CR2124","unstructured":"Kolda TG, Pinar A, Plantenga T, Seshadhri C (2013) A scalable generative graph model with community structure. arXiv preprint arXiv:1302.6636"},{"issue":"3","key":"23_CR2125","doi-asserted-by":"publisher","first-page":"036106","DOI":"10.1103\/PhysRevE.82.036106","volume":"82","author":"D Krioukov","year":"2010","unstructured":"Krioukov D, Papadopoulos F, Kitsak M, Vahdat A, Boguna M (2010) Hyperbolic geometry of complex networks. Phys Rev E 82(3):036106","journal-title":"Phys Rev E"},{"key":"23_CR2126","doi-asserted-by":"crossref","unstructured":"Kunegis J (2013) KONECT: the koblenz network collection. In: Carr L, Laen-der AHF, L\u00f3scio BF, King I, Fontoura M, Vrandecic D, Aroyo L, de Oliveira JPM, Lima F, Wilde E (eds) 22nd International World Wide Web conference, WWW \u201813, Rio de Janeiro 13\u201317 May 2013, Companion Volume, pp 1343\u20131350. International World Wide Web Conferences Steering Committee\/ACM","DOI":"10.1145\/2487788.2488173"},{"key":"23_CR2127","unstructured":"Lambiotte R (2010) Multi-scale modularity in complex networks. In: 8th International symposium on modeling and optimization in mobile, ad-hoc and wireless networks (WiOpt 2010), 31 May\u20134 June. University of Avignon, Avignon, pp 546\u2013553. IEEE"},{"key":"23_CR2128","doi-asserted-by":"crossref","unstructured":"Lancichinetti A, Fortunato S (2009) Community detection algorithms: a comparative analysis. Phys Rev E 80(5)","DOI":"10.1103\/PhysRevE.80.056117"},{"key":"23_CR2129","doi-asserted-by":"publisher","first-page":"066122","DOI":"10.1103\/PhysRevE.84.066122","volume":"84","author":"A Lancichinetti","year":"2011","unstructured":"Lancichinetti A, Fortunato S (2011) Limits of modularity maximization in community detection. Phys Rev E 84:066122","journal-title":"Phys Rev E"},{"issue":"4","key":"23_CR2130","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 (2008) Benchmark graphs for testing community detection algorithms. Phys Rev E 78(4):046110","journal-title":"Phys Rev E"},{"key":"23_CR2131","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.jpdc.2014.09.012","volume":"76","author":"D LaSalle","year":"2015","unstructured":"LaSalle D, Karypis G (2015) Multi-threaded modularity based graph clustering using the multilevel paradigm. J Parallel Distrib Comput 76:66\u201380","journal-title":"J Parallel Distrib Comput"},{"key":"23_CR2132","unstructured":"Leskovec J. Stanford Network Analysis Package (SNAP). http:\/\/snap.stanford.edu\/index.html. Online. Accessed 17 Apr 2016"},{"key":"23_CR2133","doi-asserted-by":"crossref","unstructured":"von Looz M, Meyerhenke H, Prutkin R (2015) Generating random hyperbolic graphs in subquadratic time. In: Elbassioni KM, Makino K (eds) Algorithms and computation \u2013 26th international symposium, ISAAC 2015, Nagoya 9\u201311 Dec 2015, Proceedings. Lecture notes in computer science, vol 9472. Springer, pp 467\u2013478","DOI":"10.1007\/978-3-662-48971-0_40"},{"key":"23_CR2134","doi-asserted-by":"crossref","unstructured":"Meyer U, Penschuck M (2016) Generating massive scale-free networks under resource constraints. In: Goodrich MT, Mitzenmacher M (eds) Proceedings of the eighteenth workshop on algorithm engineering and experiments, ALENEX 2016, Arlington, pp 39\u201352. SIAM 2016","DOI":"10.1137\/1.9781611974317.4"},{"key":"23_CR2135","unstructured":"Newman M. Network data. http:\/\/www-personal.umich.edu\/~mejn\/netdata\/. Online. Accessed 28 Sept 2012"},{"key":"23_CR2136","doi-asserted-by":"crossref","unstructured":"Ovelg\u00f6nne M, Geyer-Schulz A (2012) An ensemble learning strategy for graph clustering. In: Proceedings of graph partitioning and graph clustering, 10th DIMACS implementation challenge workshop, 2012. Contemporary mathematics, vol 588. American Mathematical Society","DOI":"10.1090\/conm\/588\/11701"},{"key":"23_CR2137","doi-asserted-by":"crossref","unstructured":"Riedy EJ, Meyerhenke H, Ediger D, Bader DA (2012) Parallel community detection for massive graphs. In: Proceedings of graph partitioning and graph clustering, 10th DIMACS implementation challenge workshop, 2012. Contemporary mathematics, vol 588. American Mathematical Society","DOI":"10.1090\/conm\/588\/11703"},{"issue":"7","key":"23_CR2138","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1016\/j.ipl.2016.02.004","volume":"116","author":"P Sanders","year":"2016","unstructured":"Sanders P, Schulz C (2016) Scalable generation of scale-free graphs. Inform Process Lett 116(7):489\u2013491","journal-title":"Inform Process Lett"},{"key":"23_CR2139","doi-asserted-by":"crossref","unstructured":"Seshadhri C, Kolda TG, Pinar A (2012) Community structure and scale-free collections of Erd\u0151s-R\u00e9nyi graphs. Phys Rev E 85(5)","DOI":"10.1103\/PhysRevE.85.056109"},{"issue":"2","key":"23_CR2140","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1023\/B:JOGO.0000042115.44455.f3","volume":"29","author":"AJ Soper","year":"2004","unstructured":"Soper AJ, Walshaw C, Cross M (2004) A combined evolutionary search and multilevel optimisation approach to graph-partitioning. J Glob Optim 29(2):225\u2013241","journal-title":"J Glob Optim"},{"issue":"1","key":"23_CR2141","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1109\/TPDS.2015.2390633","volume":"27","author":"CL Staudt","year":"2016","unstructured":"Staudt CL, Meyerhenke H (2016) Engineering parallel algorithms for community detection in massive networks. IEEE Trans Parallel Distrib Syst 27(1):171\u2013184","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"23_CR2142","unstructured":"Staudt C, Sazonovs A, Meyerhenke H (2015) Networkit: A tool suite for large-scale complex network analysis. CoRR, abs\/1403.3005"},{"key":"23_CR2143","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts DJ, Strogatz SH (1998) Collective dynamics of \u201csmall-world\u201d networks. Nature 393:440\u2013442","journal-title":"Nature"},{"key":"23_CR2144","series-title":"Lecture notes in computer science","first-page":"231","volume-title":"Performance evaluation of complex systems: techniques and tools","author":"R Weicker","year":"2002","unstructured":"Weicker R (2002) Benchmarking. In: Calzarossa M, Tucci S (eds) Performance evaluation of complex systems: techniques and tools, Lecture notes in computer science, vol 2459. Springer, Berlin\/Heidelberg, pp 231\u2013242"}],"container-title":["Encyclopedia of Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4939-7131-2_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,25]],"date-time":"2022-08-25T13:33:32Z","timestamp":1661434412000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4939-7131-2_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9781493971305","9781493971312"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-1-4939-7131-2_23","relation":{},"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"12 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}