{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T09:34:47Z","timestamp":1774949687028,"version":"3.50.1"},"publisher-location":"Cham","reference-count":77,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031215339","type":"print"},{"value":"9783031215346","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,1,18]],"date-time":"2023-01-18T00:00:00Z","timestamp":1674000000000},"content-version":"vor","delay-in-days":382,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The abundance of massive network data in a plethora of applications makes scalable analysis algorithms and software tools necessary to generate knowledge from such data in reasonable time. Addressing scalability as well as other requirements such as good usability and a rich feature set, the open-source software <jats:sc>NetworKit<\/jats:sc> has established itself as a popular tool for large-scale network analysis. This chapter provides a brief overview of the contributions to <jats:sc>NetworKit<\/jats:sc> made by the SPP\u00a01736. Algorithmic contributions in the areas of centrality computations, community detection, and sparsification are in the focus, but we also mention several other aspects \u2013 such as current software engineering principles of the project and ways to visualize network data within a <jats:sc>NetworKit<\/jats:sc>-based workflow.<\/jats:p>","DOI":"10.1007\/978-3-031-21534-6_1","type":"book-chapter","created":{"date-parts":[[2023,1,17]],"date-time":"2023-01-17T20:02:53Z","timestamp":1673985773000},"page":"3-20","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Algorithms for Large-Scale Network Analysis and the NetworKit Toolkit"],"prefix":"10.1007","author":[{"given":"Eugenio","family":"Angriman","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9709-9478","authenticated-orcid":false,"given":"Alexander","family":"van der Grinten","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Hamann","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7769-726X","authenticated-orcid":false,"given":"Henning","family":"Meyerhenke","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2630-7548","authenticated-orcid":false,"given":"Manuel","family":"Penschuck","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,18]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Angriman, E., Becker, R., D\u2019Angelo, G., Gilbert, H., van der Grinten, A., Meyerhenke, H.: Group-harmonic and group-closeness maximization - approximation and engineering. In: ALENEX. SIAM (2021)","DOI":"10.1137\/1.9781611976472.12"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Angriman, E., Bisenius, P., Bergamini, E., Meyerhenke, H.: Computing top-$$k$$ closeness centrality in fully-dynamic graphs. Taylor & Francis (2021). Currently in review","DOI":"10.1201\/9781003033707-10"},{"key":"1_CR3","doi-asserted-by":"publisher","unstructured":"Angriman, E., van der Grinten, A., Bojchevski, A., Z\u00fcgner, D., G\u00fcnnemann, S., Meyerhenke, H.: Group centrality maximization for large-scale graphs. In: ALENEX, pp. 56\u201369. SIAM (2020). https:\/\/doi.org\/10.1137\/1.9781611976007.5","DOI":"10.1137\/1.9781611976007.5"},{"issue":"7","key":"1_CR4","doi-asserted-by":"publisher","first-page":"127","DOI":"10.3390\/a12070127","volume":"12","author":"E Angriman","year":"2019","unstructured":"Angriman, E., et al.: Guidelines for experimental algorithmics: a case study in network analysis. Algorithms 12(7), 127 (2019). https:\/\/doi.org\/10.3390\/a12070127","journal-title":"Algorithms"},{"key":"1_CR5","doi-asserted-by":"publisher","unstructured":"Angriman, E., van der Grinten, A., Meyerhenke, H.: Local search for group closeness maximization on big graphs. In: BigData, pp. 711\u2013720. IEEE (2019). https:\/\/doi.org\/10.1109\/BigData47090.2019.9006206","DOI":"10.1109\/BigData47090.2019.9006206"},{"key":"1_CR6","doi-asserted-by":"publisher","unstructured":"Angriman, E., Predari, M., van der Grinten, A., Meyerhenke, H.: Approximation of the diagonal of a Laplacian\u2019s pseudoinverse for complex network analysis. In: ESA, pp. 6:1\u20136:24. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2020.6","DOI":"10.4230\/LIPIcs.ESA.2020.6"},{"key":"1_CR7","doi-asserted-by":"publisher","unstructured":"Bader, D.A., Meyerhenke, H., Sanders, P., Schulz, C., Kappes, A., Wagner, D.: Benchmarking for graph clustering and partitioning. In: Alhajj, R., Rokne, J. (eds.) Encyclopedia of Social Network Analysis and Mining, pp. 73\u201382. Springer, New York (2014). https:\/\/doi.org\/10.1007\/978-1-4614-6170-8_23","DOI":"10.1007\/978-1-4614-6170-8_23"},{"key":"1_CR8","volume-title":"Network Science","author":"AL Barab\u00e1si","year":"2016","unstructured":"Barab\u00e1si, A.L., P\u00f3sfai, M.: Network Science. Cambridge University Press, Cambridge (2016)"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Bastian, M., Heymann, S., Jacomy, M.: Gephi: an open source software for exploring and manipulating networks. In: ICWSM. The AAAI Press (2009)","DOI":"10.1609\/icwsm.v3i1.13937"},{"key":"1_CR10","volume-title":"Graph Drawing: Algorithms for the Visualization of Graphs","author":"GD Battista","year":"1999","unstructured":"Battista, G.D., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, Hoboken (1999)"},{"issue":"3","key":"1_CR11","doi-asserted-by":"publisher","first-page":"16","DOI":"10.17730\/humo.7.3.f4033344851gl053","volume":"7","author":"A Bavelas","year":"1948","unstructured":"Bavelas, A.: A mathematical model for group structures. Hum. Organ. 7(3), 16\u201330 (1948)","journal-title":"Hum. Organ."},{"key":"1_CR12","doi-asserted-by":"publisher","unstructured":"Bergamini, E., Borassi, M., Crescenzi, P., Marino, A., Meyerhenke, H.: Computing top-k closeness centrality faster in unweighted graphs. ACM Trans. Knowl. Discov. Data 13(5), 53:1\u201353:40 (2019). https:\/\/doi.org\/10.1145\/3344719","DOI":"10.1145\/3344719"},{"key":"1_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3166071","volume":"23","author":"E Bergamini","year":"2018","unstructured":"Bergamini, E., Crescenzi, P., D\u2019Angelo, G., Meyerhenke, H., Severini, L., Velaj, Y.: Improving the betweenness centrality of a node by adding links. ACM J. Exp. Algorithmics 23, 1\u201332 (2018). https:\/\/doi.org\/10.1145\/3166071","journal-title":"ACM J. Exp. Algorithmics"},{"key":"1_CR14","doi-asserted-by":"publisher","unstructured":"Bergamini, E., Gonser, T., Meyerhenke, H.: Scaling up group closeness maximization. In: ALENEX, pp. 209\u2013222. SIAM (2018). https:\/\/doi.org\/10.1137\/1.9781611975055.18","DOI":"10.1137\/1.9781611975055.18"},{"issue":"5","key":"1_CR15","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1080\/15427951.2016.1177802","volume":"12","author":"E Bergamini","year":"2016","unstructured":"Bergamini, E., Meyerhenke, H.: Approximating betweenness centrality in fully dynamic networks. Internet Math. 12(5), 281\u2013314 (2016). https:\/\/doi.org\/10.1080\/15427951.2016.1177802","journal-title":"Internet Math."},{"key":"1_CR16","doi-asserted-by":"publisher","unstructured":"Bergamini, E., Meyerhenke, H., Ortmann, M., Slobbe, A.: Faster betweenness centrality updates in evolving networks. In: SEA, pp. 23:1\u201323:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2017). https:\/\/doi.org\/10.4230\/LIPIcs.SEA.2017.23","DOI":"10.4230\/LIPIcs.SEA.2017.23"},{"key":"1_CR17","doi-asserted-by":"publisher","unstructured":"Bergamini, E., Wegner, M., Lukarski, D., Meyerhenke, H.: Estimating current-flow closeness centrality with a multigrid Laplacian solver. In: CSC, pp. 1\u201312. SIAM (2016). https:\/\/doi.org\/10.1137\/1.9781611974690.ch1","DOI":"10.1137\/1.9781611974690.ch1"},{"key":"1_CR18","doi-asserted-by":"publisher","unstructured":"Bisenius, P., Bergamini, E., Angriman, E., Meyerhenke, H.: Computing top-k closeness centrality in fully-dynamic graphs. In: ALENEX, pp. 21\u201335. SIAM (2018). https:\/\/doi.org\/10.1137\/1.9781611975055.3","DOI":"10.1137\/1.9781611975055.3"},{"key":"1_CR19","doi-asserted-by":"publisher","unstructured":"Bl\u00e4sius, T., Friedrich, T., Katzmann, M., Meyer, U., Penschuck, M., Weyand, C.: Efficiently generating geometric inhomogeneous and hyperbolic random graphs. In: ESA, pp. 21:1\u201321:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2019.21","DOI":"10.4230\/LIPIcs.ESA.2019.21"},{"issue":"10","key":"1_CR20","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., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech: Theory Exp. 2008(10), P10008 (2008). https:\/\/doi.org\/10.1088\/1742-5468\/2008\/10\/p10008","journal-title":"J. Stat. Mech: Theory Exp."},{"issue":"3\u20134","key":"1_CR21","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1080\/15427951.2013.865686","volume":"10","author":"P Boldi","year":"2014","unstructured":"Boldi, P., Vigna, S.: Axioms for centrality. Internet Math. 10(3\u20134), 222\u2013262 (2014). https:\/\/doi.org\/10.1080\/15427951.2013.865686","journal-title":"Internet Math."},{"key":"1_CR22","doi-asserted-by":"publisher","unstructured":"Borassi, M., Natale, E.: KADABRA is an adaptive algorithm for betweenness via random approximation. ACM J. Exp. Algorithmics 24(1), 1.2:1\u20131.2:35 (2019). https:\/\/doi.org\/10.1145\/3284359","DOI":"10.1145\/3284359"},{"issue":"2","key":"1_CR23","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1080\/0022250X.2001.9990249","volume":"25","author":"U Brandes","year":"2001","unstructured":"Brandes, U.: A faster algorithm for betweenness centrality. J. Math. Sociol. 25(2), 163\u2013177 (2001). https:\/\/doi.org\/10.1080\/0022250X.2001.9990249","journal-title":"J. Math. Sociol."},{"issue":"2","key":"1_CR24","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). https:\/\/doi.org\/10.1109\/TKDE.2007.190689","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"1_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-662-48350-3_22","volume-title":"Algorithms - ESA 2015","author":"U Brandes","year":"2015","unstructured":"Brandes, U., Hamann, M., Strasser, B., Wagner, D.: Fast quasi-threshold editing. In: Bansal, N., Finocchi, I. (eds.) ESA 2015. LNCS, vol. 9294, pp. 251\u2013262. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48350-3_22"},{"issue":"1","key":"1_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/nws.2013.2","volume":"1","author":"U Brandes","year":"2013","unstructured":"Brandes, U., Robins, G., McCranie, A., Wasserman, S.: What is network science? Netw. Sci. 1(1), 1\u201315 (2013). https:\/\/doi.org\/10.1017\/nws.2013.2","journal-title":"Netw. Sci."},{"issue":"18","key":"1_CR27","doi-asserted-by":"publisher","first-page":"3825","DOI":"10.1016\/j.comnet.2012.10.007","volume":"56","author":"S Brin","year":"2012","unstructured":"Brin, S., Page, L.: Reprint of: the anatomy of a large-scale hypertextual web search engine. Comput. Netw. 56(18), 3825\u20133833 (2012). https:\/\/doi.org\/10.1016\/j.comnet.2012.10.007","journal-title":"Comput. Netw."},{"key":"1_CR28","doi-asserted-by":"publisher","unstructured":"Carstens, C.J., Hamann, M., Meyer, U., Penschuck, M., Tran, H., Wagner, D.: Parallel and I\/O-efficient randomisation of massive networks using global curveball trades. In: ESA, pp. 11:1\u201311:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2018.11","DOI":"10.4230\/LIPIcs.ESA.2018.11"},{"key":"1_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-319-46922-5_4","volume-title":"Databases Theory and Applications","author":"C Chen","year":"2016","unstructured":"Chen, C., Wang, W., Wang, X.: Efficient maximum closeness centrality group identification. In: Cheema, M.A., Zhang, W., Chang, L. (eds.) ADC 2016. LNCS, vol. 9877, pp. 43\u201355. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46922-5_4"},{"key":"1_CR30","doi-asserted-by":"publisher","unstructured":"Crescenzi, P., D\u2019Angelo, G., Severini, L., Velaj, Y.: Greedily improving our own closeness centrality in a network. ACM Trans. Knowl. Discov. Data 11(1), 9:1\u20139:32 (2016). https:\/\/doi.org\/10.1145\/2953882","DOI":"10.1145\/2953882"},{"issue":"3","key":"1_CR31","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1080\/0022250X.1999.9990219","volume":"23","author":"MG Everett","year":"1999","unstructured":"Everett, M.G., Borgatti, S.P.: The centrality of groups and classes. J. Math. Sociol. 23(3), 181\u2013201 (1999). https:\/\/doi.org\/10.1080\/0022250X.1999.9990219","journal-title":"J. Math. Sociol."},{"key":"1_CR32","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). https:\/\/doi.org\/10.1016\/j.physrep.2016.09.002","journal-title":"Phys. Rep."},{"key":"1_CR33","doi-asserted-by":"publisher","unstructured":"Glantz, R., Meyerhenke, H.: Many-to-many correspondences between partitions: introducing a cut-based approach. In: SDM, pp. 1\u20139. SIAM (2018). https:\/\/doi.org\/10.1137\/1.9781611975321.1","DOI":"10.1137\/1.9781611975321.1"},{"issue":"4","key":"1_CR34","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1142\/S0219525903001067","volume":"6","author":"PM Gleiser","year":"2003","unstructured":"Gleiser, P.M., Danon, L.: Community structure in jazz. Adv. Complex Syst. 6(4), 565\u2013574 (2003). https:\/\/doi.org\/10.1142\/S0219525903001067","journal-title":"Adv. Complex Syst."},{"key":"1_CR35","doi-asserted-by":"publisher","unstructured":"van der Grinten, A., Angriman, E., Meyerhenke, H.: Scaling up network centrality computations - a brief overview. IT - Inf. Technol. 62(3\u20134), 189\u2013204 (2020). https:\/\/doi.org\/10.1515\/itit-2019-0032","DOI":"10.1515\/itit-2019-0032"},{"key":"1_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1007\/978-3-030-29400-7_31","volume-title":"Euro-Par 2019: Parallel Processing","author":"A Grinten","year":"2019","unstructured":"Grinten, A., Angriman, E., Meyerhenke, H.: Parallel adaptive sampling with almost no synchronization. In: Yahyapour, R. (ed.) Euro-Par 2019. LNCS, vol. 11725, pp. 434\u2013447. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-29400-7_31"},{"key":"1_CR37","doi-asserted-by":"crossref","unstructured":"van der Grinten, A., Angriman, E., Predari, M., Meyerhenke, H.: New approximation algorithms for forest closeness centrality - for individual vertices and vertex groups. In: SDM, pp. 136\u2013144. SIAM (2021)","DOI":"10.1137\/1.9781611976700.16"},{"key":"1_CR38","doi-asserted-by":"publisher","unstructured":"van der Grinten, A., Bergamini, E., Green, O., Bader, D.A., Meyerhenke, H.: Scalable Katz ranking computation in large static and dynamic graphs. In: ESA, pp. 42:1\u201342:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2018.42","DOI":"10.4230\/LIPIcs.ESA.2018.42"},{"key":"1_CR39","doi-asserted-by":"publisher","unstructured":"van der Grinten, A., Meyerhenke, H.: Scaling betweenness approximation to billions of edges by MPI-based adaptive sampling. In: IPDPS, pp. 527\u2013535. IEEE (2020). https:\/\/doi.org\/10.1109\/IPDPS47924.2020.00061","DOI":"10.1109\/IPDPS47924.2020.00061"},{"key":"1_CR40","doi-asserted-by":"publisher","unstructured":"Hamann, M., Lindner, G., Meyerhenke, H., Staudt, C.L., Wagner, D.: Structure-preserving sparsification methods for social networks. Soc. Netw. Anal. Min. 6(1), 22:1\u201322:22 (2016). https:\/\/doi.org\/10.1007\/s13278-016-0332-2","DOI":"10.1007\/s13278-016-0332-2"},{"issue":"3","key":"1_CR41","doi-asserted-by":"publisher","first-page":"90","DOI":"10.3390\/a10030090","volume":"10","author":"M Hamann","year":"2017","unstructured":"Hamann, M., R\u00f6hrs, E., Wagner, D.: Local community detection based on small cliques. Algorithms 10(3), 90 (2017). https:\/\/doi.org\/10.3390\/a10030090","journal-title":"Algorithms"},{"issue":"1","key":"1_CR42","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1109\/2945.841119","volume":"6","author":"I Herman","year":"2000","unstructured":"Herman, I., Melan\u00e7on, G., Marshall, M.S.: Graph visualization and navigation in information visualization: a survey. IEEE Trans. Vis. Comput. Graph. 6(1), 24\u201343 (2000). https:\/\/doi.org\/10.1109\/2945.841119","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"4","key":"1_CR43","doi-asserted-by":"publisher","first-page":"72","DOI":"10.3390\/a9040072","volume":"9","author":"D Hoske","year":"2016","unstructured":"Hoske, D., Lukarski, D., Meyerhenke, H., Wegner, M.: Engineering a combinatorial Laplacian solver: lessons learned. Algorithms 9(4), 72 (2016). https:\/\/doi.org\/10.3390\/a9040072","journal-title":"Algorithms"},{"issue":"6","key":"1_CR44","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0098679","volume":"9","author":"M Jacomy","year":"2014","unstructured":"Jacomy, M., Venturini, T., Heymann, S., Bastian, M.: ForceAtlas2, a continuous graph layout algorithm for handy network visualization designed for the Gephi software. PLoS ONE 9(6), e98679 (2014)","journal-title":"PLoS ONE"},{"key":"1_CR45","doi-asserted-by":"publisher","unstructured":"Kepner, J., et al.: Mathematical foundations of the GraphBLAS. In: HPEC, pp. 1\u20139. IEEE (2016). https:\/\/doi.org\/10.1109\/HPEC.2016.7761646","DOI":"10.1109\/HPEC.2016.7761646"},{"key":"1_CR46","doi-asserted-by":"publisher","unstructured":"Koch, J., Staudt, C.L., Vogel, M., Meyerhenke, H.: An empirical comparison of big graph frameworks in the context of network analysis. Soc. Netw. Anal. Min. 6(1), 84:1\u201384:20 (2016). https:\/\/doi.org\/10.1007\/s13278-016-0394-1","DOI":"10.1007\/s13278-016-0394-1"},{"key":"1_CR47","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-15200-0_1","volume-title":"Digital Cultural Heritage","author":"J Kreutel","year":"2020","unstructured":"Kreutel, J.: Augmenting network analysis with linked data for humanities research. In: Kremers, H. (ed.) Digital Cultural Heritage, pp. 1\u201314. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-15200-0_1"},{"key":"1_CR48","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, 046110 (2008). https:\/\/doi.org\/10.1103\/PhysRevE.78.046110","journal-title":"Phys. Rev. E"},{"key":"1_CR49","doi-asserted-by":"publisher","DOI":"10.1515\/9781400830329","volume-title":"Google\u2019s PageRank and Beyond - The Science of Search Engine Rankings","author":"AN Langville","year":"2006","unstructured":"Langville, A.N., Meyer, C.D.: Google\u2019s PageRank and Beyond - The Science of Search Engine Rankings. Princeton University Press, Princeton (2006)"},{"key":"1_CR50","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139924801","volume-title":"Mining of Massive Datasets","author":"J Leskovec","year":"2014","unstructured":"Leskovec, J., Rajaraman, A., Ullman, J.D.: Mining of Massive Datasets, 2nd edn. Cambridge University Press, Cambridge (2014)","edition":"2"},{"key":"1_CR51","doi-asserted-by":"publisher","unstructured":"Livne, O.E., Brandt, A.: Lean algebraic multigrid (LAMG): fast graph Laplacian linear solver. SIAM J. Sci. Comput. 34(4), B499\u2013B522 (2012). https:\/\/doi.org\/10.1137\/110843563","DOI":"10.1137\/110843563"},{"key":"1_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/978-3-319-44543-4_35","volume-title":"Combinatorial Algorithms","author":"M von Looz","year":"2016","unstructured":"von Looz, M., Meyerhenke, H.: Querying probabilistic neighborhoods in spatial data sets efficiently. In: M\u00e4kinen, V., Puglisi, S.J., Salmela, L. (eds.) IWOCA 2016. LNCS, vol. 9843, pp. 449\u2013460. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-44543-4_35"},{"key":"1_CR53","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3195635","volume":"23","author":"M von Looz","year":"2018","unstructured":"von Looz, M., Meyerhenke, H.: Updating dynamic random hyperbolic graphs in sublinear time. ACM J. Exp. Algorithmics 23, 1\u201330 (2018). https:\/\/doi.org\/10.1145\/3195635","journal-title":"ACM J. Exp. Algorithmics"},{"key":"1_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/978-3-662-48971-0_40","volume-title":"Algorithms and Computation","author":"M von Looz","year":"2015","unstructured":"von Looz, M., Meyerhenke, H., Prutkin, R.: Generating random hyperbolic graphs in subquadratic time. In: Elbassioni, K., Makino, K. (eds.) ISAAC 2015. LNCS, vol. 9472, pp. 467\u2013478. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48971-0_40"},{"key":"1_CR55","doi-asserted-by":"publisher","unstructured":"von Looz, M., \u00d6zdayi, M.S., Laue, S., Meyerhenke, H.: Generating massive complex networks with hyperbolic geometry faster in practice. In: HPEC, pp. 1\u20136. IEEE (2016). https:\/\/doi.org\/10.1109\/HPEC.2016.7761644","DOI":"10.1109\/HPEC.2016.7761644"},{"key":"1_CR56","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/978-3-319-38851-9_24","volume-title":"Experimental Algorithms","author":"M von Looz","year":"2016","unstructured":"von Looz, M., Wolter, M., Jacob, C.R., Meyerhenke, H.: Better partitions of protein graphs for subsystem quantum chemistry. In: Goldberg, A.V., Kulikov, A.S. (eds.) SEA 2016. LNCS, vol. 9685, pp. 353\u2013368. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-38851-9_24"},{"key":"1_CR57","doi-asserted-by":"publisher","unstructured":"Mahmoody, A., Tsourakakis, C.E., Upfal, E.: Scalable betweenness centrality maximization via sampling. In: KDD, pp. 1765\u20131773. ACM (2016). https:\/\/doi.org\/10.1145\/2939672.2939869","DOI":"10.1145\/2939672.2939869"},{"issue":"5","key":"1_CR58","doi-asserted-by":"publisher","first-page":"1814","DOI":"10.1109\/TVCG.2017.2689016","volume":"24","author":"H Meyerhenke","year":"2018","unstructured":"Meyerhenke, H., N\u00f6llenburg, M., Schulz, C.: Drawing large graphs by multilevel maxent-stress optimization. IEEE Trans. Vis. Comput. Graph. 24(5), 1814\u20131827 (2018). https:\/\/doi.org\/10.1109\/TVCG.2017.2689016","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"1","key":"1_CR59","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41598-018-29131-0","volume":"8","author":"FB Mocnik","year":"2018","unstructured":"Mocnik, F.B.: The polynomial volume law of complex networks in the context of local and global optimization. Sci. Rep. 8(1), 1\u201310 (2018). https:\/\/doi.org\/10.1038\/s41598-018-29131-0","journal-title":"Sci. Rep."},{"key":"1_CR60","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/978-3-319-23374-1_3","volume-title":"Spatial Information Theory","author":"F-B Mocnik","year":"2015","unstructured":"Mocnik, F.-B., Frank, A.U.: Modelling spatial structures. In: Fabrikant, S.I., Raubal, M., Bertolotto, M., Davies, C., Freundschuh, S., Bell, S. (eds.) COSIT 2015. LNCS, vol. 9368, pp. 44\u201364. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23374-1_3"},{"issue":"3","key":"1_CR61","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/j.socnet.2013.05.001","volume":"35","author":"J Nastos","year":"2013","unstructured":"Nastos, J., Gao, Y.: Familial groups in social networks. Soc. Netw. 35(3), 439\u2013450 (2013). https:\/\/doi.org\/10.1016\/j.socnet.2013.05.001","journal-title":"Soc. Netw."},{"key":"1_CR62","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780198805090.001.0001","volume-title":"Networks","author":"M Newman","year":"2018","unstructured":"Newman, M.: Networks, 2nd edn. Oxford University Press, Oxford (2018)","edition":"2"},{"key":"1_CR63","doi-asserted-by":"publisher","first-page":"026113","DOI":"10.1103\/PhysRevE.69.026113","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 (2004). https:\/\/doi.org\/10.1103\/PhysRevE.69.026113","journal-title":"Phys. Rev. E"},{"issue":"2","key":"1_CR64","doi-asserted-by":"publisher","first-page":"595","DOI":"10.7155\/jgaa.00370","volume":"19","author":"A Nocaj","year":"2015","unstructured":"Nocaj, A., Ortmann, M., Brandes, U.: Untangling the hairballs of multi-centered, small-world online social media networks. J. Graph Algorithms Appl. 19(2), 595\u2013618 (2015). https:\/\/doi.org\/10.7155\/jgaa.00370","journal-title":"J. Graph Algorithms Appl."},{"key":"1_CR65","doi-asserted-by":"publisher","unstructured":"Peel, L., Larremore, D.B., Clauset, A.: The ground truth about metadata and community detection in networks. Sci. Adv. 3(5), e1602548 (2017). https:\/\/doi.org\/10.1126\/sciadv.1602548","DOI":"10.1126\/sciadv.1602548"},{"key":"1_CR66","doi-asserted-by":"publisher","unstructured":"Riondato, M., Kornaropoulos, E.M.: Fast approximation of betweenness centrality through sampling. In: WSDM, pp. 413\u2013422. ACM (2014). https:\/\/doi.org\/10.1145\/2556195.2556224","DOI":"10.1145\/2556195.2556224"},{"key":"1_CR67","unstructured":"Rochat, Y.: Closeness centrality extended to unconnected graphs: the harmonic centrality index. In: ASNA, Applications of Social Network Analysis (2009)"},{"key":"1_CR68","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1145\/1963190.1970376","volume":"16","author":"R Rotta","year":"2011","unstructured":"Rotta, R., Noack, A.: Multilevel local search algorithms for modularity clustering. ACM J. Exp. Algorithmics 16, 27 (2011). https:\/\/doi.org\/10.1145\/1963190.1970376","journal-title":"ACM J. Exp. Algorithmics"},{"key":"1_CR69","doi-asserted-by":"publisher","unstructured":"Satuluri, V., Parthasarathy, S., Ruan, Y.: Local graph sparsification for scalable clustering. In: SIGMOD Conference, pp. 721\u2013732. ACM (2011). https:\/\/doi.org\/10.1145\/1989323.1989399","DOI":"10.1145\/1989323.1989399"},{"key":"1_CR70","doi-asserted-by":"publisher","unstructured":"\u015eim\u015fek, M., Meyerhenke, H.: Combined centrality measures for an improved characterization of influence spread in social networks. J. Complex Netw. 8(1), cnz048 (2020). https:\/\/doi.org\/10.1093\/comnet\/cnz048","DOI":"10.1093\/comnet\/cnz048"},{"key":"1_CR71","doi-asserted-by":"publisher","unstructured":"Staudt, C., Marrakchi, Y., Meyerhenke, H.: Detecting communities around seed nodes in complex networks. In: BigData, pp. 62\u201369. IEEE Computer Society (2014). https:\/\/doi.org\/10.1109\/BigData.2014.7004373","DOI":"10.1109\/BigData.2014.7004373"},{"key":"1_CR72","doi-asserted-by":"publisher","unstructured":"Staudt, C., Meyerhenke, H.: Engineering high-performance community detection heuristics for massive graphs. In: ICPP, pp. 180\u2013189. IEEE Computer Society (2013). https:\/\/doi.org\/10.1109\/ICPP.2013.27","DOI":"10.1109\/ICPP.2013.27"},{"key":"1_CR73","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/s41109-017-0054-z","volume":"2","author":"CL Staudt","year":"2017","unstructured":"Staudt, C.L., Hamann, M., Gutfraind, A., Safro, I., Meyerhenke, H.: Generating realistic scaled complex networks. Appl. Netw. Sci. 2, 36 (2017). https:\/\/doi.org\/10.1007\/s41109-017-0054-z","journal-title":"Appl. Netw. Sci."},{"issue":"1","key":"1_CR74","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 Distrib. Syst. 27(1), 171\u2013184 (2016). https:\/\/doi.org\/10.1109\/TPDS.2015.2390633","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"4","key":"1_CR75","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1017\/nws.2016.20","volume":"4","author":"CL Staudt","year":"2016","unstructured":"Staudt, C.L., Sazonovs, A., Meyerhenke, H.: NetworKit: a tool suite for large-scale complex network analysis. Netw. Sci. 4(4), 508\u2013530 (2016). https:\/\/doi.org\/10.1017\/nws.2016.20","journal-title":"Netw. Sci."},{"key":"1_CR76","doi-asserted-by":"publisher","unstructured":"Wegner, M., Taubert, O., Schug, A., Meyerhenke, H.: Maxent-stress optimization of 3D biomolecular models. In: ESA, pp. 70:1\u201370:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2017). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2017.70","DOI":"10.4230\/LIPIcs.ESA.2017.70"},{"key":"1_CR77","doi-asserted-by":"publisher","unstructured":"Zweig, K.A.: Network Analysis Literacy - A Practical Approach to the Analysis of Networks. Lecture Notes in Social Networks. Springer, Vienna (2016). https:\/\/doi.org\/10.1007\/978-3-7091-0741-6","DOI":"10.1007\/978-3-7091-0741-6"}],"container-title":["Lecture Notes in Computer Science","Algorithms for Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-21534-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,17]],"date-time":"2023-01-17T20:03:16Z","timestamp":1673985796000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-21534-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031215339","9783031215346"],"references-count":77,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-21534-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"18 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}