{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:20:44Z","timestamp":1773656444222,"version":"3.50.1"},"reference-count":113,"publisher":"Walter de Gruyter GmbH","issue":"3-4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,5,27]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Network science methodology is increasingly applied to a large variety of real-world phenomena, often leading to big network data sets. Thus, networks (or graphs) with millions or billions of edges are more and more common. To process and analyze these data, we need appropriate graph processing systems and fast algorithms. Yet, many analysis algorithms were pioneered on small networks when speed was not the highest concern. Developing an analysis toolkit for large-scale networks thus often requires faster variants, both from an algorithmic and an implementation perspective. In this paper we focus on computational aspects of vertex centrality measures. Such measures indicate the (relative) importance of a vertex based on the position of the vertex in the network. We describe several common (and some recent and thus less established) measures, optimization problems in their context as well as algorithms for an efficient solution of the raised problems. Our focus is on (not necessarily exact) performance-oriented algorithmic techniques that enable significantly faster processing than the previous state of the art \u2013 often allowing to process massive data sets quickly and without resorting to distributed graph processing systems.<\/jats:p>","DOI":"10.1515\/itit-2019-0032","type":"journal-article","created":{"date-parts":[[2020,3,11]],"date-time":"2020-03-11T09:01:20Z","timestamp":1583917280000},"page":"189-204","source":"Crossref","is-referenced-by-count":7,"title":["Scaling up network centrality computations \u2013 A brief overview"],"prefix":"10.1515","volume":"62","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9709-9478","authenticated-orcid":false,"given":"Alexander","family":"van der Grinten","sequence":"first","affiliation":[{"name":"Humboldt-Universit\u00e4t zu Berlin , Department of Computer Science , Unter den Linden 6 , Berlin , Germany"}]},{"given":"Eugenio","family":"Angriman","sequence":"additional","affiliation":[{"name":"Humboldt-Universit\u00e4t zu Berlin , Department of Computer Science , Unter den Linden 6 , Berlin , Germany"}]},{"given":"Henning","family":"Meyerhenke","sequence":"additional","affiliation":[{"name":"Humboldt-Universit\u00e4t zu Berlin , Department of Computer Science , Unter den Linden 6 , Berlin , Germany"}]}],"member":"374","published-online":{"date-parts":[[2020,3,11]]},"reference":[{"key":"2023033120254880109_j_itit-2019-0032_ref_001_w2aab3b7d226b1b6b1ab2b1b1Aa","doi-asserted-by":"crossref","unstructured":"M. Newman, Networks. OUP Oxford, 2nd ed., 2018.","DOI":"10.1093\/oso\/9780198805090.001.0001"},{"key":"2023033120254880109_j_itit-2019-0032_ref_002_w2aab3b7d226b1b6b1ab2b1b2Aa","unstructured":"A.-L. Barab\u00e1si et al., Network science. Cambridge university press, 2016."},{"key":"2023033120254880109_j_itit-2019-0032_ref_003_w2aab3b7d226b1b6b1ab2b1b3Aa","doi-asserted-by":"crossref","unstructured":"Y. Zhang, V. Kiriansky, C. Mendis, S.\u2009P. Amarasinghe, and M. Zaharia, \u201cMaking caches work for graph analytics,\u201d in 2017 IEEE International Conference on Big Data, BigData (Boston, MA, USA), pp.\u2009293\u2013302, IEEE, 2017.","DOI":"10.1109\/BigData.2017.8257937"},{"key":"2023033120254880109_j_itit-2019-0032_ref_004_w2aab3b7d226b1b6b1ab2b1b4Aa","doi-asserted-by":"crossref","unstructured":"K. Erciyes, Complex Networks. An Algorithmic Perspective. CRC Press, 2015.","DOI":"10.1201\/b17409"},{"key":"2023033120254880109_j_itit-2019-0032_ref_005_w2aab3b7d226b1b6b1ab2b1b5Aa","doi-asserted-by":"crossref","unstructured":"K. Steinhaeuser, N.\u2009V. Chawla, and A.\u2009R. Ganguly, \u201cComplex networks as a unified framework for descriptive analysis and predictive modeling in climate science,\u201d Statistical Analysis and Data Mining: The ASA Data Science Journal, vol.\u20094, no.\u20095, pp.\u2009497\u2013511, 2011.","DOI":"10.1002\/sam.10100"},{"key":"2023033120254880109_j_itit-2019-0032_ref_006_w2aab3b7d226b1b6b1ab2b1b6Aa","doi-asserted-by":"crossref","unstructured":"P. Boldi and S. Vigna, \u201cAxioms for centrality,\u201d Internet Mathematics, vol.\u200910, no.\u20093\u20134, pp.\u2009222\u2013262, 2014.","DOI":"10.1080\/15427951.2013.865686"},{"key":"2023033120254880109_j_itit-2019-0032_ref_007_w2aab3b7d226b1b6b1ab2b1b7Aa","doi-asserted-by":"crossref","unstructured":"S. Brin and L. Page, \u201cThe anatomy of a large-scale hypertextual web search engine,\u201d Computer Networks and ISDN Systems, vol.\u200930, no.\u20091, pp.\u2009107\u2013117, 1998. Proceedings of the 7th International World Wide Web Conference, WWW 1998.","DOI":"10.1016\/S0169-7552(98)00110-X"},{"key":"2023033120254880109_j_itit-2019-0032_ref_008_w2aab3b7d226b1b6b1ab2b1b8Aa","doi-asserted-by":"crossref","unstructured":"U. Kang, S. Papadimitriou, J. Sun, and T. Hanghang, \u201cCentralities in large networks: Algorithms and observations,\u201d in Proceedings of the 11th SIAM International Conference on Data Mining (SDM), pp.\u2009119\u2013130, 2011.","DOI":"10.1137\/1.9781611972818.11"},{"key":"2023033120254880109_j_itit-2019-0032_ref_009_w2aab3b7d226b1b6b1ab2b1b9Aa","doi-asserted-by":"crossref","unstructured":"D. Chen, L. L\u00fc, M.-S. Shang, Y.-C. Zhang, and T. Zhou, \u201cIdentifying influential nodes in complex networks,\u201d Physica a: Statistical mechanics and its applications, vol.\u2009391, no.\u20094, pp.\u20091777\u20131787, 2012.","DOI":"10.1016\/j.physa.2011.09.017"},{"key":"2023033120254880109_j_itit-2019-0032_ref_010_w2aab3b7d226b1b6b1ab2b1c10Aa","doi-asserted-by":"crossref","unstructured":"S. Heidari, Y. Simmhan, R.\u2009N. Calheiros, and R. Buyya, \u201cScalable graph processing frameworks: A taxonomy and open challenges,\u201d ACM Computing Surveys (CSUR), vol.\u200951, no.\u20093, pp.\u20091\u201353, 2018.","DOI":"10.1145\/3199523"},{"key":"2023033120254880109_j_itit-2019-0032_ref_011_w2aab3b7d226b1b6b1ab2b1c11Aa","doi-asserted-by":"crossref","unstructured":"C.\u2009L. Staudt, A. Sazonovs, and H. Meyerhenke, \u201cNetworKit: A tool suite for large-scale complex network analysis,\u201d Network Science, vol.\u20094, no.\u20094, pp.\u2009508\u2013530, 2016.","DOI":"10.1017\/nws.2016.20"},{"key":"2023033120254880109_j_itit-2019-0032_ref_012_w2aab3b7d226b1b6b1ab2b1c12Aa","doi-asserted-by":"crossref","unstructured":"E. Angriman, A. van der Grinten, M. von Looz, H. Meyerhenke, M. N\u00f6llenburg, M. Predari, and C. Tzovas, \u201cGuidelines for experimental algorithmics: A case study in network analysis,\u201d Algorithms, vol.\u200912, no.\u20097, p.\u2009127, 2019.","DOI":"10.3390\/a12070127"},{"key":"2023033120254880109_j_itit-2019-0032_ref_013_w2aab3b7d226b1b6b1ab2b1c13Aa","doi-asserted-by":"crossref","unstructured":"A. van der Grinten and H. Meyerhenke, \u201cScaling up network centrality computations,\u201d in Design, Automation & Test in Europe Conference & Exhibition, DATE 2019, Florence, Italy, March 25\u201329, 2019 (J. Teich and F. Fummi, eds.), pp.\u20091319\u20131324, IEEE, 2019.","DOI":"10.23919\/DATE.2019.8714773"},{"key":"2023033120254880109_j_itit-2019-0032_ref_014_w2aab3b7d226b1b6b1ab2b1c14Aa","doi-asserted-by":"crossref","unstructured":"T. Akiba, Y. Iwata, and Y. Yoshida, \u201cFast exact shortest-path distance queries on large networks by pruned landmark labeling,\u201d in Proceedings of the International Conference on Management of Data, SIGMOD 2013, pp.\u2009349\u2013360, ACM, 2013.","DOI":"10.1145\/2463676.2465315"},{"key":"2023033120254880109_j_itit-2019-0032_ref_015_w2aab3b7d226b1b6b1ab2b1c15Aa","doi-asserted-by":"crossref","unstructured":"U. Brandes, \u201cA faster algorithm for betweenness centrality,\u201d Journal of Mathematical Sociology, vol.\u200925, no.\u20092, pp.\u2009163\u2013177, 2001.","DOI":"10.1080\/0022250X.2001.9990249"},{"key":"2023033120254880109_j_itit-2019-0032_ref_016_w2aab3b7d226b1b6b1ab2b1c16Aa","doi-asserted-by":"crossref","unstructured":"R. Puzis, Y. Elovici, P. Zilberman, S. Dolev, and U. Brandes, \u201cTopology manipulations for speeding betweenness centrality computation,\u201d Journal of Complex Networks, vol.\u20093, no.\u20091, pp.\u200984\u2013112, 2015.","DOI":"10.1093\/comnet\/cnu015"},{"key":"2023033120254880109_j_itit-2019-0032_ref_017_w2aab3b7d226b1b6b1ab2b1c17Aa","doi-asserted-by":"crossref","unstructured":"A.\u2009E. Sariy\u00fcce, K. Kaya, E. Saule, and U.\u2009V. \u00c7ataly\u00fcrek, \u201cGraph manipulations for fast centrality computation,\u201d Transactions on Knowledge Discovery from Data (TKDD), vol.\u200911, pp.\u200926:1\u201326:25, April 2017.","DOI":"10.1145\/3022668"},{"key":"2023033120254880109_j_itit-2019-0032_ref_018_w2aab3b7d226b1b6b1ab2b1c18Aa","doi-asserted-by":"crossref","unstructured":"F. Vella, M. Bernaschi, and G. Carbone, \u201cDynamic merging of frontiers for accelerating the evaluation of betweenness centrality,\u201d Journal of Experimental Algorithmics (JEA), vol.\u200923, pp.\u20091.4:1\u20131.4:19, March 2018.","DOI":"10.1145\/3182656"},{"key":"2023033120254880109_j_itit-2019-0032_ref_019_w2aab3b7d226b1b6b1ab2b1c19Aa","doi-asserted-by":"crossref","unstructured":"E. Solomonik, M. Besta, F. Vella, and T. Hoefler, \u201cScaling betweenness centrality using communication-efficient sparse matrix multiplication,\u201d in SC, pp.\u200947:1\u201347:14, ACM, 2017.","DOI":"10.1145\/3126908.3126971"},{"key":"2023033120254880109_j_itit-2019-0032_ref_020_w2aab3b7d226b1b6b1ab2b1c20Aa","unstructured":"E. Bergamini, H. Meyerhenke, M. Ortmann, and A. Slobbe, \u201cFaster betweenness centrality updates in evolving networks,\u201d in Proceedings of the 16th International Symposium on Experimental Algorithms, (SEA), vol.\u200975 of LIPIcs, pp.\u200923:1\u201323:16, Schloss Dagstuhl \u2013 Leibniz-Zentrum fuer Informatik, 2017."},{"key":"2023033120254880109_j_itit-2019-0032_ref_021_w2aab3b7d226b1b6b1ab2b1c21Aa","doi-asserted-by":"crossref","unstructured":"M. Borassi, P. Crescenzi, and M. Habib, \u201cInto the square: On the complexity of some quadratic-time solvable problems,\u201d Electronic Notes in Theoretical Computer Science, vol.\u2009322, pp.\u200951\u201367, 2016. Proceedings of the 16th Italian Conference on Theoretical Computer Science (ICTCS).","DOI":"10.1016\/j.entcs.2016.03.005"},{"key":"2023033120254880109_j_itit-2019-0032_ref_022_w2aab3b7d226b1b6b1ab2b1c22Aa","unstructured":"M. Bentert, A. Dittmann, L. Kellerhals, A. Nichterlein, and R. Niedermeier, \u201cAn Adaptive Version of Brandes\u2019 Algorithm for Betweenness Centrality,\u201d in Proceedings of the 9th International Symposium on Algorithms and Computation (ISAAC 2018) (W.-L. Hsu, D.-T. Lee, and C.-S. Liao, eds.), vol.\u2009123 of LIPIcs, pp.\u200936:1\u201336:13, Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, 2018."},{"key":"2023033120254880109_j_itit-2019-0032_ref_023_w2aab3b7d226b1b6b1ab2b1c23Aa","doi-asserted-by":"crossref","unstructured":"Y. Jia, V. Lu, J. Hoberock, M. Garland, and J.\u2009C. Hart, \u201cEdge v. node parallelism for graph centrality metrics,\u201d in GPU Computing Gems Jade Edition, pp.\u200915\u201328, Elsevier, 2011.","DOI":"10.1016\/B978-0-12-385963-1.00002-2"},{"key":"2023033120254880109_j_itit-2019-0032_ref_024_w2aab3b7d226b1b6b1ab2b1c24Aa","doi-asserted-by":"crossref","unstructured":"A. McLaughlin and D.\u2009A. Bader, \u201cScalable and high performance betweenness centrality on the GPU,\u201d in Proceedings of the 2014 International Conference for High Performance Computing, Networking, Storage and Analysis, (SC), pp.\u2009572\u2013583, IEEE, 2014.","DOI":"10.1109\/SC.2014.52"},{"key":"2023033120254880109_j_itit-2019-0032_ref_025_w2aab3b7d226b1b6b1ab2b1c25Aa","doi-asserted-by":"crossref","unstructured":"M. Bernaschi, G. Carbone, and F. Vella, \u201cScalable betweenness centrality on multi-GPU systems,\u201d in Proceedings of the 13th Conference On Computing Frontiers (CF), pp.\u200929\u201336, ACM, 2016.","DOI":"10.1145\/2903150.2903153"},{"key":"2023033120254880109_j_itit-2019-0032_ref_026_w2aab3b7d226b1b6b1ab2b1c26Aa","doi-asserted-by":"crossref","unstructured":"U. Meyer and P. Sanders, \u201c\u03b4-stepping: a parallelizable shortest path algorithm,\u201d Journal of Algorithms, vol.\u200949, no.\u20091, pp.\u2009114\u2013152, 2003.","DOI":"10.1016\/S0196-6774(03)00076-2"},{"key":"2023033120254880109_j_itit-2019-0032_ref_027_w2aab3b7d226b1b6b1ab2b1c27Aa","doi-asserted-by":"crossref","unstructured":"S. Maleki, D. Nguyen, A. Lenharth, M. Garzar\u00e1n, D. Padua, and K. Pingali, \u201cDsmr: A parallel algorithm for single-source shortest path problem,\u201d in Proceedings of the 30th International Conference on Supercomputing (ICS), pp.\u20091\u201314, ACM, 2016.","DOI":"10.1145\/2925426.2926287"},{"key":"2023033120254880109_j_itit-2019-0032_ref_028_w2aab3b7d226b1b6b1ab2b1c28Aa","doi-asserted-by":"crossref","unstructured":"M.\u2009J. Rattigan, M. Maier, and D. Jensen, \u201cUsing structure indices for efficient approximation of network properties,\u201d in Proceedings of the 12th International Conference on Knowledge Discovery and Data Mining (SIGKDD), pp.\u2009357\u2013366, ACM, 2006.","DOI":"10.1145\/1150402.1150443"},{"key":"2023033120254880109_j_itit-2019-0032_ref_029_w2aab3b7d226b1b6b1ab2b1c29Aa","doi-asserted-by":"crossref","unstructured":"R. Geisberger, P. Sanders, and D. Schultes, \u201cBetter approximation of betweenness centrality,\u201d in 2008 Proceedings of the 10th Workshop on Algorithm Engineering and Experiments (ALENEX), pp.\u200990\u2013100, SIAM, 2008.","DOI":"10.1137\/1.9781611972887.9"},{"key":"2023033120254880109_j_itit-2019-0032_ref_030_w2aab3b7d226b1b6b1ab2b1c30Aa","doi-asserted-by":"crossref","unstructured":"C. Li, Q. Li, P. Van Mieghem, H. Stanley, and H. Wang, \u201cCorrelation between centrality metrics and their application to the opinion model,\u201d Eur. Phys. J. B, vol.\u200988, no.\u200965, 2015.","DOI":"10.1140\/epjb\/e2015-50671-y"},{"key":"2023033120254880109_j_itit-2019-0032_ref_031_w2aab3b7d226b1b6b1ab2b1c31Aa","doi-asserted-by":"crossref","unstructured":"D.\u2009A. Bader, S. Kintali, K. Madduri, and M. Mihail, \u201cApproximating betweenness centrality,\u201d in International Workshop on Algorithms and Models for the Web-Graph, pp.\u2009124\u2013137, Springer, 2007.","DOI":"10.1007\/978-3-540-77004-6_10"},{"key":"2023033120254880109_j_itit-2019-0032_ref_032_w2aab3b7d226b1b6b1ab2b1c32Aa","doi-asserted-by":"crossref","unstructured":"M. Riondato and E.\u2009M. Kornaropoulos, \u201cFast approximation of betweenness centrality through sampling,\u201d Data Mining and Knowledge Discovery, vol.\u200930, no.\u20092, pp.\u2009438\u2013475, 2016.","DOI":"10.1007\/s10618-015-0423-0"},{"key":"2023033120254880109_j_itit-2019-0032_ref_033_w2aab3b7d226b1b6b1ab2b1c33Aa","doi-asserted-by":"crossref","unstructured":"M. Borassi and E. Natale, \u201cKADABRA is an adaptive algorithm for betweenness via random approximation,\u201d in Proceedings of the 24th Annual European Symposium on Algorithms (ESA), vol.\u200957 of LIPIcs, pp.\u200920:1\u201320:18, Schloss Dagstuhl \u2013 Leibniz-Zentrum fuer Informatik, 2016.","DOI":"10.1145\/3284359"},{"key":"2023033120254880109_j_itit-2019-0032_ref_034_w2aab3b7d226b1b6b1ab2b1c34Aa","doi-asserted-by":"crossref","unstructured":"A. van der Grinten, E. Angriman, and H. Meyerhenke, \u201cParallel adaptive sampling with almost no synchronization,\u201d in Proceedings of the 25th International Conference on Parallel and Distributed Computing (Euro-Par), vol.\u200911725 of Lecture Notes in Computer Science, pp.\u2009434\u2013447, Springer, 2019.","DOI":"10.1007\/978-3-030-29400-7_31"},{"key":"2023033120254880109_j_itit-2019-0032_ref_035_w2aab3b7d226b1b6b1ab2b1c35Aa","doi-asserted-by":"crossref","unstructured":"A. van der Grinten and H. Meyerhenke, \u201cScaling betweenness approximation to billions of edges by mpi-based adaptive sampling,\u201d in Proceedings of the 34th International Parallel and Distributed Processing Symposium (IPDPS), 2020.","DOI":"10.1109\/IPDPS47924.2020.00061"},{"key":"2023033120254880109_j_itit-2019-0032_ref_036_w2aab3b7d226b1b6b1ab2b1c36Aa","doi-asserted-by":"crossref","unstructured":"E. Bergamini and H. Meyerhenke, \u201cApproximating betweenness centrality in fully dynamic networks,\u201d Internet Mathematics, vol.\u200912, no.\u20095, pp.\u2009281\u2013314, 2016.","DOI":"10.1080\/15427951.2016.1177802"},{"key":"2023033120254880109_j_itit-2019-0032_ref_037_w2aab3b7d226b1b6b1ab2b1c37Aa","doi-asserted-by":"crossref","unstructured":"Z. AlGhamdi, F. Jamour, S. Skiadopoulos, and P. Kalnis, \u201cA benchmark for betweenness centrality approximation algorithms on large graphs,\u201d in Proceedings of the 29th International Conference on Scientific and Statistical Database Management (SSDBM), pp.\u20096:1\u20136:12, 2017.","DOI":"10.1145\/3085504.3085510"},{"key":"2023033120254880109_j_itit-2019-0032_ref_038_w2aab3b7d226b1b6b1ab2b1c38Aa","doi-asserted-by":"crossref","unstructured":"E. Bergamini, P. Crescenzi, G. D\u2019angelo, H. Meyerhenke, L. Severini, and Y. Velaj, \u201cImproving the betweenness centrality of a node by adding links,\u201d Journal of Experimental Algorithmics, vol.\u200923, pp.\u20091.5:1\u20131.5:32, August 2018.","DOI":"10.1145\/3166071"},{"key":"2023033120254880109_j_itit-2019-0032_ref_039_w2aab3b7d226b1b6b1ab2b1c39Aa","doi-asserted-by":"crossref","unstructured":"C. Hoffmann, H. Molter, and M. Sorge, \u201cThe parameterized complexity of centrality improvement in networks,\u201d in SOFSEM 2018: Theory and Practice of Computer Science \u2013 44th International Conference on Current Trends in Theory and Practice of Computer Science, pp.\u2009111\u2013124, 2018.","DOI":"10.1007\/978-3-319-73117-9_8"},{"key":"2023033120254880109_j_itit-2019-0032_ref_040_w2aab3b7d226b1b6b1ab2b1c40Aa","doi-asserted-by":"crossref","unstructured":"M. Lozano and H.\u2009M. Trujillo, \u201cOptimizing node infiltrations in complex networks by a local search based heuristic,\u201d Computers & Operations Research, vol.\u2009111, pp.\u2009197\u2013213, 2019.","DOI":"10.1016\/j.cor.2019.06.011"},{"key":"2023033120254880109_j_itit-2019-0032_ref_041_w2aab3b7d226b1b6b1ab2b1c41Aa","doi-asserted-by":"crossref","unstructured":"E. Bergamini, M. Borassi, P. Crescenzi, A. Marino, and H. Meyerhenke, \u201cComputing top-k closeness centrality faster in unweighted graphs,\u201d in Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2016, pp.\u200968\u201380, SIAM, 2016.","DOI":"10.1137\/1.9781611974317.6"},{"key":"2023033120254880109_j_itit-2019-0032_ref_042_w2aab3b7d226b1b6b1ab2b1c42Aa","doi-asserted-by":"crossref","unstructured":"A.\u2009E. Sariy\u00fcce, E. Saule, K. Kaya, and \u00dc.\u2009V. \u00c7ataly\u00fcrek, \u201cRegularizing graph centrality computations,\u201d Journal of Parallel and Distributed Computing, vol.\u200976, pp.\u2009106\u2013119, 2015.","DOI":"10.1016\/j.jpdc.2014.07.006"},{"key":"2023033120254880109_j_itit-2019-0032_ref_043_w2aab3b7d226b1b6b1ab2b1c43Aa","doi-asserted-by":"crossref","unstructured":"E. Cohen, D. Delling, T. Pajor, and R.\u2009F. Werneck, \u201cComputing classic closeness centrality, at scale,\u201d in Proceedings of the second ACM conference on Online social networks, pp.\u200937\u201350, 2014.","DOI":"10.1145\/2660460.2660465"},{"key":"2023033120254880109_j_itit-2019-0032_ref_044_w2aab3b7d226b1b6b1ab2b1c44Aa","doi-asserted-by":"crossref","unstructured":"Y. Lin, J. Zhang, Y. Ying, S. Hong, and H. Li, \u201cFvbm: A filter-verification-based method for finding top-k closeness centrality on dynamic social networks,\u201d in Web Technologies and Applications (F. Li, K. Shim, K. Zheng, and G. Liu, eds.), (Cham), pp.\u2009389\u2013392, Springer International Publishing, 2016.","DOI":"10.1007\/978-3-319-45817-5_31"},{"key":"2023033120254880109_j_itit-2019-0032_ref_045_w2aab3b7d226b1b6b1ab2b1c45Aa","doi-asserted-by":"crossref","unstructured":"P. Bisenius, E. Bergamini, E. Angriman, and H. Meyerhenke, \u201cComputing top-k closeness centrality in fully-dynamic graphs,\u201d in Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, ALENEX 2018, pp.\u200921\u201335, SIAM, 2018.","DOI":"10.1137\/1.9781611975055.3"},{"key":"2023033120254880109_j_itit-2019-0032_ref_046_w2aab3b7d226b1b6b1ab2b1c46Aa","doi-asserted-by":"crossref","unstructured":"P. Crescenzi, G. D\u2019angelo, L. Severini, and Y. Velaj, \u201cGreedily improving our own closeness centrality in a network,\u201d ACM Trans. Knowl. Discov. Data, vol.\u200911, pp.\u20099:1\u20139:32, July 2016.","DOI":"10.1145\/2953882"},{"key":"2023033120254880109_j_itit-2019-0032_ref_047_w2aab3b7d226b1b6b1ab2b1c47Aa","doi-asserted-by":"crossref","unstructured":"M.\u2009G. Everett and S.\u2009P. Borgatti, \u201cThe centrality of groups and classes,\u201d Journal of mathematical sociology, vol.\u200923, no.\u20093, pp.\u2009181\u2013201, 1999.","DOI":"10.1080\/0022250X.1999.9990219"},{"key":"2023033120254880109_j_itit-2019-0032_ref_048_w2aab3b7d226b1b6b1ab2b1c48Aa","doi-asserted-by":"crossref","unstructured":"V. Arya, N. Garg, R. Khandekar, A. Meyerson, K. Munagala, and V. Pandit, \u201cLocal search heuristics for k-median and facility location problems,\u201d SIAM Journal on computing, vol.\u200933, no.\u20093, pp.\u2009544\u2013562, 2004.","DOI":"10.1137\/S0097539702416402"},{"key":"2023033120254880109_j_itit-2019-0032_ref_049_w2aab3b7d226b1b6b1ab2b1c49Aa","doi-asserted-by":"crossref","unstructured":"C. Chen, W. Wang, and X. Wang, \u201cEfficient maximum closeness centrality group identification,\u201d in Australasian Database Conference, pp.\u200943\u201355, Springer, 2016.","DOI":"10.1007\/978-3-319-46922-5_4"},{"key":"2023033120254880109_j_itit-2019-0032_ref_050_w2aab3b7d226b1b6b1ab2b1c50Aa","doi-asserted-by":"crossref","unstructured":"E. Bergamini, T. Gonser, and H. Meyerhenke, \u201cScaling up group closeness maximization,\u201d in Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, ALENEX 2018, pp.\u2009209\u2013222, SIAM, 2018. Updated version from May 15, 2019: https:\/\/arxiv.org\/abs\/1710.01144.","DOI":"10.1137\/1.9781611975055.18"},{"key":"2023033120254880109_j_itit-2019-0032_ref_051_w2aab3b7d226b1b6b1ab2b1c51Aa","doi-asserted-by":"crossref","unstructured":"E. Angriman, A. van der Grinten, and H. Meyerhenke, \u201cLocal search for group closeness maximization on big graphs,\u201d in 2019 IEEE International Conference on Big Data, BigData, (Los Angeles, CA, USA), IEEE, 2019.","DOI":"10.1109\/BigData47090.2019.9006206"},{"key":"2023033120254880109_j_itit-2019-0032_ref_052_w2aab3b7d226b1b6b1ab2b1c52Aa","doi-asserted-by":"crossref","unstructured":"K. Edwards, W.\u2009S. Kennedy, and I. Saniee, \u201cFast approximation algorithms for p-centers in large \u03b4-hyperbolic graphs,\u201d Algorithmica, vol.\u200980, no.\u200912, pp.\u20093889\u20133907, 2018.","DOI":"10.1007\/s00453-018-0425-6"},{"key":"2023033120254880109_j_itit-2019-0032_ref_053_w2aab3b7d226b1b6b1ab2b1c53Aa","doi-asserted-by":"crossref","unstructured":"A. Mahmoody, C.\u2009E. Tsourakakis, and E. Upfal, \u201cScalable betweenness centrality maximization via sampling,\u201d in Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining KDD, pp.\u20091765\u20131773, ACM, 2016.","DOI":"10.1145\/2939672.2939869"},{"key":"2023033120254880109_j_itit-2019-0032_ref_054_w2aab3b7d226b1b6b1ab2b1c54Aa","doi-asserted-by":"crossref","unstructured":"E. Bergamini, M. Wegner, D. Lukarski, and H. Meyerhenke, \u201cEstimating current-flow closeness centrality with a multigrid Laplacian solver,\u201d in 2016 Proceedings of the Seventh SIAM Workshop on Combinatorial Scientific Computing, CSC 2016, pp.\u20091\u201312, SIAM, 2016.","DOI":"10.1137\/1.9781611974690.ch1"},{"key":"2023033120254880109_j_itit-2019-0032_ref_055_w2aab3b7d226b1b6b1ab2b1c55Aa","unstructured":"U. Brandes and D. Fleischer, \u201cCentrality measures based on current flow,\u201d in Proceedings of 22nd Annual Symposium on Theoretical Aspects of Computer Science, STACS 2005, Stuttgart, Germany, February 24\u201326, 2005, (V. Diekert and B. Durand, eds.), vol.\u20093404 of Lecture Notes in Computer Science, pp.\u2009533\u2013544, Springer, 2005."},{"key":"2023033120254880109_j_itit-2019-0032_ref_056_w2aab3b7d226b1b6b1ab2b1c56Aa","doi-asserted-by":"crossref","unstructured":"A. Ghosh, S. Boyd, and A. Saberi, \u201cMinimizing effective resistance of a graph,\u201d SIAM review, vol.\u200950, no.\u20091, pp.\u200937\u201366, 2008.","DOI":"10.1137\/050645452"},{"key":"2023033120254880109_j_itit-2019-0032_ref_057_w2aab3b7d226b1b6b1ab2b1c57Aa","doi-asserted-by":"crossref","unstructured":"A.\u2009K. Chandra, P. Raghavan, W.\u2009L. Ruzzo, R. Smolensky, and P. Tiwari, \u201cThe electrical resistance of a graph captures its commute and cover times,\u201d Computational Complexity, vol.\u20096, no.\u20094, pp.\u2009312\u2013340, 1996.","DOI":"10.1007\/BF01270385"},{"key":"2023033120254880109_j_itit-2019-0032_ref_058_w2aab3b7d226b1b6b1ab2b1c58Aa","doi-asserted-by":"crossref","unstructured":"P. Van Mieghem, K. Devriendt, and H. Cetinay, \u201cPseudoinverse of the Laplacian and best spreader node in a network,\u201d Phys. Rev. E, vol.\u200996, p.\u2009032311, Sep 2017.","DOI":"10.1103\/PhysRevE.96.032311"},{"key":"2023033120254880109_j_itit-2019-0032_ref_059_w2aab3b7d226b1b6b1ab2b1c59Aa","doi-asserted-by":"crossref","unstructured":"D.\u2009A. Spielman and N. Srivastava, \u201cGraph sparsification by effective resistances,\u201d SIAM Journal on Computing, vol.\u200940, no.\u20096, pp.\u20091913\u20131926, 2011.","DOI":"10.1137\/080734029"},{"key":"2023033120254880109_j_itit-2019-0032_ref_060_w2aab3b7d226b1b6b1ab2b1c60Aa","doi-asserted-by":"crossref","unstructured":"E. Bozzo and M. Franceschet, \u201cResistance distance, closeness, and betweenness,\u201d Social Networks, vol.\u200935, no.\u20093, pp.\u2009460\u2013469, 2013.","DOI":"10.1016\/j.socnet.2013.05.003"},{"key":"2023033120254880109_j_itit-2019-0032_ref_061_w2aab3b7d226b1b6b1ab2b1c61Aa","doi-asserted-by":"crossref","unstructured":"E. Bozzo and M. Franceschet, \u201cApproximations of the generalized inverse of the graph Laplacian matrix,\u201d Internet mathematics, vol.\u20098, no.\u20094, pp.\u2009456\u2013481, 2012.","DOI":"10.1080\/15427951.2012.715115"},{"key":"2023033120254880109_j_itit-2019-0032_ref_062_w2aab3b7d226b1b6b1ab2b1c62Aa","doi-asserted-by":"crossref","unstructured":"O.\u2009E. Livne and A. Brandt, \u201cLean algebraic multigrid (LAMG): Fast graph Laplacian linear solver,\u201d SIAM Journal on Scientific Computing, vol.\u200934, no.\u20094, pp.\u2009B499\u2013B522, 2012.","DOI":"10.1137\/110843563"},{"key":"2023033120254880109_j_itit-2019-0032_ref_063_w2aab3b7d226b1b6b1ab2b1c63Aa","doi-asserted-by":"crossref","unstructured":"C.\u2009L. Staudt, A. Sazonovs, and H. Meyerhenke, \u201cNetworkit: A tool suite for large-scale complex network analysis,\u201d Network Science, vol.\u20094, no.\u20094, pp.\u2009508\u2013530, 2016.","DOI":"10.1017\/nws.2016.20"},{"key":"2023033120254880109_j_itit-2019-0032_ref_064_w2aab3b7d226b1b6b1ab2b1c64Aa","doi-asserted-by":"crossref","unstructured":"U. Brandes and C. Pich, \u201cCentrality estimation in large networks,\u201d International Journal of Bifurcation and Chaos, vol.\u200917, no.\u20097, pp.\u20092303\u20132318, 2007.","DOI":"10.1142\/S0218127407018403"},{"key":"2023033120254880109_j_itit-2019-0032_ref_065_w2aab3b7d226b1b6b1ab2b1c65Aa","doi-asserted-by":"crossref","unstructured":"C. Mavroforakis, R. Garcia-Lebron, I. Koutis, and E. Terzi, \u201cSpanning edge centrality: Large-scale computation and applications,\u201d in Proceedings of the 24th International World Wide Web Conference, WWW 2015, pp.\u2009732\u2013742, ACM, 2015.","DOI":"10.1145\/2736277.2741125"},{"key":"2023033120254880109_j_itit-2019-0032_ref_066_w2aab3b7d226b1b6b1ab2b1c66Aa","doi-asserted-by":"crossref","unstructured":"H. Li, R. Peng, L. Shan, Y. Yi, and Z. Zhang, \u201cCurrent flow group closeness centrality for complex networks,\u201d in The World Wide Web Conference, WWW 2019, pp.\u2009961\u2013971, ACM, 2019.","DOI":"10.1145\/3308558.3313490"},{"key":"2023033120254880109_j_itit-2019-0032_ref_067_w2aab3b7d226b1b6b1ab2b1c67Aa","doi-asserted-by":"crossref","unstructured":"P. Drineas and M.\u2009W. Mahoney, \u201cRandnla: randomized numerical linear algebra,\u201d Commun. ACM, vol.\u200959, no.\u20096, pp.\u200980\u201390, 2016.","DOI":"10.1145\/2842602"},{"key":"2023033120254880109_j_itit-2019-0032_ref_068_w2aab3b7d226b1b6b1ab2b1c68Aa","doi-asserted-by":"crossref","unstructured":"K. Stephenson and M. Zelen, \u201cRethinking centrality: Methods and examples,\u201d Social Networks, vol.\u200911, no.\u20091, pp.\u20091\u201337, 1989.","DOI":"10.1016\/0378-8733(89)90016-6"},{"key":"2023033120254880109_j_itit-2019-0032_ref_069_w2aab3b7d226b1b6b1ab2b1c69Aa","doi-asserted-by":"crossref","unstructured":"L. Shan, Y. Yi, and Z. Zhang, \u201cImproving information centrality of a node in complex networks by adding edges,\u201d in Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI-18, pp.\u20093535\u20133541, International Joint Conferences on Artificial Intelligence Organization, July 2018.","DOI":"10.24963\/ijcai.2018\/491"},{"key":"2023033120254880109_j_itit-2019-0032_ref_070_w2aab3b7d226b1b6b1ab2b1c70Aa","unstructured":"A.\u2009S. Teixeira, P.\u2009T. Monteiro, J.\u2009A. Carri\u00e7o, M. Ramirez, and A.\u2009P. Francisco, \u201cSpanning edge betweenness,\u201d in Workshop on Mining and Learning with Graphs, vol.\u200924, pp.\u200927\u201331, 2013."},{"key":"2023033120254880109_j_itit-2019-0032_ref_071_w2aab3b7d226b1b6b1ab2b1c71Aa","doi-asserted-by":"crossref","unstructured":"B. Bollob\u00e1s, Modern Graph Theory. Springer-Verlag, 1998.","DOI":"10.1007\/978-1-4612-0619-4"},{"key":"2023033120254880109_j_itit-2019-0032_ref_072_w2aab3b7d226b1b6b1ab2b1c72Aa","unstructured":"T. Hayashi, T. Akiba, and Y. Yoshida, \u201cEfficient algorithms for spanning tree centrality,\u201d in Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI\u201916, pp.\u20093733\u20133739, AAAI Press, 2016."},{"key":"2023033120254880109_j_itit-2019-0032_ref_073_w2aab3b7d226b1b6b1ab2b1c73Aa","doi-asserted-by":"crossref","unstructured":"D.\u2009B. Wilson, \u201cGenerating random spanning trees more quickly than the cover time,\u201d in Proceedings of the Twenty-eighth Annual ACM Symposium on Theory of Computing, STOC\u201996, (New York, NY, USA), pp.\u2009296\u2013303, ACM, 1996.","DOI":"10.1145\/237814.237880"},{"key":"2023033120254880109_j_itit-2019-0032_ref_074_w2aab3b7d226b1b6b1ab2b1c74Aa","doi-asserted-by":"crossref","unstructured":"W. Ellens, F. Spieksma, P. Van Mieghem, A. Jamakovic, and R. Kooij, \u201cEffective graph resistance,\u201d Linear algebra and its applications, vol.\u2009435, no.\u200910, pp.\u20092491\u20132506, 2011.","DOI":"10.1016\/j.laa.2011.02.024"},{"key":"2023033120254880109_j_itit-2019-0032_ref_075_w2aab3b7d226b1b6b1ab2b1c75Aa","doi-asserted-by":"crossref","unstructured":"H. Li and Z. Zhang, \u201cKirchhoff index as a measure of edge centrality in weighted networks: Nearly linear time algorithms,\u201d in SODA, pp.\u20092377\u20132396, SIAM, 2018.","DOI":"10.1137\/1.9781611975031.153"},{"key":"2023033120254880109_j_itit-2019-0032_ref_076_w2aab3b7d226b1b6b1ab2b1c76Aa","doi-asserted-by":"crossref","unstructured":"R. Kyng and S. Sachdeva, \u201cApproximate Gaussian elimination for Laplacians \u2013 fast, sparse, and simple,\u201d in IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS 2016, pp.\u2009573\u2013582, IEEE Computer Society, 2016.","DOI":"10.1109\/FOCS.2016.68"},{"key":"2023033120254880109_j_itit-2019-0032_ref_077_w2aab3b7d226b1b6b1ab2b1c77Aa","doi-asserted-by":"crossref","unstructured":"K. Deweese, J.\u2009R. Gilbert, G.\u2009L. Miller, R. Peng, H.\u2009R. Xu, and S.\u2009C. Xu, \u201cAn empirical study of cycle toggling based Laplacian solvers,\u201d in 2016 Proceedings of the Seventh SIAM Workshop on Combinatorial Scientific Computing, CSC 2016, pp.\u200933\u201341, SIAM, 2016.","DOI":"10.1137\/1.9781611974690.ch4"},{"key":"2023033120254880109_j_itit-2019-0032_ref_078_w2aab3b7d226b1b6b1ab2b1c78Aa","doi-asserted-by":"crossref","unstructured":"D. Hoske, D. Lukarski, H. Meyerhenke, and M. Wegner, \u201cEngineering a combinatorial Laplacian solver: Lessons learned,\u201d Algorithms, vol.\u20099, no.\u20094, p.\u200972, 2016.","DOI":"10.3390\/a9040072"},{"key":"2023033120254880109_j_itit-2019-0032_ref_079_w2aab3b7d226b1b6b1ab2b1c79Aa","doi-asserted-by":"crossref","unstructured":"R. Kyng and S. Sachdeva, \u201cApproximate Gaussian elimination for Laplacians \u2013 fast, sparse, and simple,\u201d in 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS), pp.\u2009573\u2013582, Oct 2016.","DOI":"10.1109\/FOCS.2016.68"},{"key":"2023033120254880109_j_itit-2019-0032_ref_080_w2aab3b7d226b1b6b1ab2b1c80Aa","doi-asserted-by":"crossref","unstructured":"M.\u2009E. Newman, \u201cA measure of betweenness centrality based on random walks,\u201d Social networks, vol.\u200927, no.\u20091, pp.\u200939\u201354, 2005.","DOI":"10.1016\/j.socnet.2004.11.009"},{"key":"2023033120254880109_j_itit-2019-0032_ref_081_w2aab3b7d226b1b6b1ab2b1c81Aa","doi-asserted-by":"crossref","unstructured":"Y. Jin, Q. Bao, and Z. Zhang, \u201cForest distance closeness centrality in disconnected graphs,\u201d in ICDM, pp.\u2009339\u2013348, IEEE, 2019.","DOI":"10.1109\/ICDM.2019.00044"},{"key":"2023033120254880109_j_itit-2019-0032_ref_082_w2aab3b7d226b1b6b1ab2b1c82Aa","doi-asserted-by":"crossref","unstructured":"H. Meyerhenke and S. Schamberger, \u201cBalancing parallel adaptive FEM computations by solving systems of linear equations,\u201d in Proceedings of Euro-Par 2005, Parallel Processing, 11th International Euro-Par Conference, vol.\u20093648 of Lecture Notes in Computer Science, pp.\u2009209\u2013219, Springer, 2005.","DOI":"10.1007\/11549468_26"},{"key":"2023033120254880109_j_itit-2019-0032_ref_083_w2aab3b7d226b1b6b1ab2b1c83Aa","doi-asserted-by":"crossref","unstructured":"O. Narayan and I. Saniee, \u201cScaling of random walk betweenness in networks,\u201d in International Conference on Complex Networks and their Applications, pp.\u200941\u201351, Springer, 2018.","DOI":"10.1007\/978-3-030-05411-3_4"},{"key":"2023033120254880109_j_itit-2019-0032_ref_084_w2aab3b7d226b1b6b1ab2b1c84Aa","doi-asserted-by":"crossref","unstructured":"H. Avron and S. Toledo, \u201cRandomized algorithms for estimating the trace of an implicit symmetric positive semi-definite matrix,\u201d J. ACM, vol.\u200958, no.\u20092, pp.\u20098:1\u20138:34, 2011.","DOI":"10.1145\/1944345.1944349"},{"key":"2023033120254880109_j_itit-2019-0032_ref_085_w2aab3b7d226b1b6b1ab2b1c85Aa","doi-asserted-by":"crossref","unstructured":"E. Estrada and J.\u2009A. Rodr\u00edguez-Vel\u00e1zquez, \u201cSubgraph centrality in complex networks,\u201d Phys. Rev. E, vol.\u200971, p.\u2009056103, May 2005.","DOI":"10.1103\/PhysRevE.71.056103"},{"key":"2023033120254880109_j_itit-2019-0032_ref_086_w2aab3b7d226b1b6b1ab2b1c86Aa","doi-asserted-by":"crossref","unstructured":"M. Benzi and P. Boito, \u201cQuadrature rule-based bounds for functions of adjacency matrices,\u201d Linear Algebra and its Applications, vol.\u2009433, no.\u20093, pp.\u2009637\u2013652, 2010.","DOI":"10.1016\/j.laa.2010.03.035"},{"key":"2023033120254880109_j_itit-2019-0032_ref_087_w2aab3b7d226b1b6b1ab2b1c87Aa","unstructured":"F.\u2009E. Faisal, Y. Ineichen, A.\u2009C.\u2009I. Malossi, P. Staar, C. Bekas, and A. Curioni, \u201cMassively parallel and near linear time graph analytics\u201d."},{"key":"2023033120254880109_j_itit-2019-0032_ref_088_w2aab3b7d226b1b6b1ab2b1c88Aa","doi-asserted-by":"crossref","unstructured":"C. Bekas, E. Kokiopoulou, and Y. Saad, \u201cAn estimator for the diagonal of a matrix,\u201d Applied numerical mathematics, vol.\u200957, no.\u200911\u201312, pp.\u20091214\u20131229, 2007.","DOI":"10.1016\/j.apnum.2007.01.003"},{"key":"2023033120254880109_j_itit-2019-0032_ref_089_w2aab3b7d226b1b6b1ab2b1c89Aa","doi-asserted-by":"crossref","unstructured":"A.\u2009D. Sarma, A.\u2009R. Molla, G. Pandurangan, and E. Upfal, \u201cFast distributed pagerank computation,\u201d Theor. Comput. Sci., vol.\u2009561, pp.\u2009113\u2013121, 2015.","DOI":"10.1016\/j.tcs.2014.04.003"},{"key":"2023033120254880109_j_itit-2019-0032_ref_090_w2aab3b7d226b1b6b1ab2b1c90Aa","doi-asserted-by":"crossref","unstructured":"E.\u2009J. Riedy, \u201cUpdating pagerank for streaming graphs,\u201d in IPDPS Workshops, pp.\u2009877\u2013884, IEEE Computer Society, 2016.","DOI":"10.1109\/IPDPSW.2016.22"},{"key":"2023033120254880109_j_itit-2019-0032_ref_091_w2aab3b7d226b1b6b1ab2b1c91Aa","doi-asserted-by":"crossref","unstructured":"P. Gupta, A. Goel, J.\u2009J. Lin, A. Sharma, D. Wang, and R. Zadeh, \u201cWTF: the who to follow service at twitter,\u201d in WWW, pp.\u2009505\u2013514, International World Wide Web Conferences Steering Committee \/ ACM, 2013.","DOI":"10.1145\/2488388.2488433"},{"key":"2023033120254880109_j_itit-2019-0032_ref_092_w2aab3b7d226b1b6b1ab2b1c92Aa","doi-asserted-by":"crossref","unstructured":"D. Fogaras, B. R\u00e1cz, K. Csalog\u00e1ny, and T. Sarl\u00f3s, \u201cTowards scaling fully personalized pagerank: Algorithms, lower bounds, and experiments,\u201d Internet Mathematics, vol.\u20092, no.\u20093, pp.\u2009333\u2013358, 2005.","DOI":"10.1080\/15427951.2005.10129104"},{"key":"2023033120254880109_j_itit-2019-0032_ref_093_w2aab3b7d226b1b6b1ab2b1c93Aa","doi-asserted-by":"crossref","unstructured":"A. Geil, Y. Wang, and J.\u2009D. Owens, \u201cWtf, gpu! computing twitter\u2019s who-to-follow on the GPU,\u201d in COSN, pp.\u200963\u201368, ACM, 2014.","DOI":"10.1145\/2660460.2660481"},{"key":"2023033120254880109_j_itit-2019-0032_ref_094_w2aab3b7d226b1b6b1ab2b1c94Aa","doi-asserted-by":"crossref","unstructured":"P. Lofgren, S. Banerjee, A. Goel, and S. Comandur, \u201cFAST-PPR: scaling personalized pagerank estimation for large graphs,\u201d in Proceedings of the 20nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining KDD, pp.\u20091436\u20131445, ACM, 2014.","DOI":"10.1145\/2623330.2623745"},{"key":"2023033120254880109_j_itit-2019-0032_ref_095_w2aab3b7d226b1b6b1ab2b1c95Aa","doi-asserted-by":"crossref","unstructured":"W. Lin, \u201cDistributed algorithms for fully personalized pagerank on large graphs,\u201d in WWW, pp.\u20091084\u20131094, ACM, 2019.","DOI":"10.1145\/3308558.3313555"},{"key":"2023033120254880109_j_itit-2019-0032_ref_096_w2aab3b7d226b1b6b1ab2b1c96Aa","doi-asserted-by":"crossref","unstructured":"K. Yang, M. Zhang, K. Chen, X. Ma, Y. Bai, and Y. Jiang, \u201cKnightking: a fast distributed graph random walk engine,\u201d in SOSP, pp.\u2009524\u2013537, ACM, 2019.","DOI":"10.1145\/3341301.3359634"},{"key":"2023033120254880109_j_itit-2019-0032_ref_097_w2aab3b7d226b1b6b1ab2b1c97Aa","doi-asserted-by":"crossref","unstructured":"H. Zhang, P. Lofgren, and A. Goel, \u201cApproximate personalized pagerank on dynamic graphs,\u201d in KDD, pp.\u20091315\u20131324, ACM, 2016.","DOI":"10.1145\/2939672.2939804"},{"key":"2023033120254880109_j_itit-2019-0032_ref_098_w2aab3b7d226b1b6b1ab2b1c98Aa","doi-asserted-by":"crossref","unstructured":"L. Katz, \u201cA new status index derived from sociometric analysis,\u201d Psychometrika, vol.\u200918, no.\u20091, pp.\u200939\u201343, 1953.","DOI":"10.1007\/BF02289026"},{"key":"2023033120254880109_j_itit-2019-0032_ref_099_w2aab3b7d226b1b6b1ab2b1c99Aa","doi-asserted-by":"crossref","unstructured":"E. Nathan, G. Sanders, J.\u2009P. Fairbanks, V.\u2009E. Henson, and D.\u2009A. Bader, \u201cGraph ranking guarantees for numerical approximations to Katz centrality,\u201d in ICCS, vol.\u2009108 of Procedia Computer Science, pp.\u200968\u201378, Elsevier, 2017.","DOI":"10.1016\/j.procs.2017.05.021"},{"key":"2023033120254880109_j_itit-2019-0032_ref_100_w2aab3b7d226b1b6b1ab2b1d100Aa","unstructured":"A. van der Grinten, E. Bergamini, O. Green, D.\u2009A. Bader, and H. Meyerhenke, \u201cScalable Katz ranking computation in large static and dynamic graphs,\u201d in 26th Annual European Symposium on Algorithms, ESA 2018, vol.\u2009112 of LIPIcs, pp.\u200942:1\u201342:14, Schloss Dagstuhl \u2013 Leibniz-Zentrum fuer Informatik, 2018."},{"key":"2023033120254880109_j_itit-2019-0032_ref_101_w2aab3b7d226b1b6b1ab2b1d101Aa","doi-asserted-by":"crossref","unstructured":"F. Busato, O. Green, N. Bombieri, and D. Bader, \u201cHornet: An Efficient Data Structure for Dynamic Sparse Graphs and Matrices on GPUs,\u201d in IEEE Proc. High Performance Extreme Computing (HPEC), (Waltham, MA), 2018.","DOI":"10.1109\/HPEC.2018.8547541"},{"key":"2023033120254880109_j_itit-2019-0032_ref_102_w2aab3b7d226b1b6b1ab2b1d102Aa","doi-asserted-by":"crossref","unstructured":"F.\u2009A. Azevedo, L.\u2009R. Carvalho, L.\u2009T. Grinberg, J.\u2009M. Farfel, R.\u2009E. Ferretti, R.\u2009E. Leite, W.\u2009J. Filho, R. Lent, and S. Herculano-Houzel, \u201cEqual numbers of neuronal and nonneuronal cells make the human brain an isometrically scaled-up primate brain,\u201d Journal of Comparative Neurology, vol.\u2009513, no.\u20095, pp.\u2009532\u2013541, 2009.","DOI":"10.1002\/cne.21974"},{"key":"2023033120254880109_j_itit-2019-0032_ref_103_w2aab3b7d226b1b6b1ab2b1d103Aa","unstructured":"H. Lin, X. Zhu, B. Yu, X. Tang, W. Xue, W. Chen, L. Zhang, T. Hoefler, X. Ma, X. Liu, W. Zheng, and J. Xu, \u201cShentu: processing multi-trillion edge graphs on millions of cores in seconds,\u201d in Proceedings of the International Conference for High Performance Computing, Networking, Storage, and Analysis, SC 2018, Dallas, TX, USA, November 11\u201316, 2018, pp.\u200956:1\u201356:11, IEEE \/ ACM, 2018."},{"key":"2023033120254880109_j_itit-2019-0032_ref_104_w2aab3b7d226b1b6b1ab2b1d104Aa","doi-asserted-by":"crossref","unstructured":"G.\u2009M. Slota, S. Rajamanickam, K.\u2009D. Devine, and K. Madduri, \u201cPartitioning trillion-edge graphs in minutes,\u201d in 2017 IEEE International Parallel and Distributed Processing Symposium, IPDPS 2017, pp.\u2009646\u2013655, IEEE Computer Society, 2017.","DOI":"10.1109\/IPDPS.2017.95"},{"key":"2023033120254880109_j_itit-2019-0032_ref_105_w2aab3b7d226b1b6b1ab2b1d105Aa","doi-asserted-by":"crossref","unstructured":"H. Meyerhenke, P. Sanders, and C. Schulz, \u201cParallel graph partitioning for complex networks,\u201d IEEE Transactions on Parallel and Distributed Systems, vol.\u200928, no.\u20099, pp.\u20092625\u20132638, 2017.","DOI":"10.1109\/TPDS.2017.2671868"},{"key":"2023033120254880109_j_itit-2019-0032_ref_106_w2aab3b7d226b1b6b1ab2b1d106Aa","doi-asserted-by":"crossref","unstructured":"J. Koch, C.\u2009L. Staudt, M. Vogel, and H. Meyerhenke, \u201cAn empirical comparison of big graph frameworks in the context of network analysis,\u201d Social Network Analysis and Mining, vol.\u20096, no.\u20091, pp.\u200984:1\u201384:20, 2016.","DOI":"10.1007\/s13278-016-0394-1"},{"key":"2023033120254880109_j_itit-2019-0032_ref_107_w2aab3b7d226b1b6b1ab2b1d107Aa","unstructured":"E.\u2009R. Hein, S. Eswar, A. Yasar, J. Li, J.\u2009S. Young, T.\u2009M. Conte, \u00dc.\u2009V. \u00c7ataly\u00fcrek, R. Vuduc, E.\u2009J. Riedy, and B. U\u00e7ar, \u201cProgramming strategies for irregular algorithms on the emu chick,\u201d CoRR, abs\/1901.02775, 2019."},{"key":"2023033120254880109_j_itit-2019-0032_ref_108_w2aab3b7d226b1b6b1ab2b1d108Aa","doi-asserted-by":"crossref","unstructured":"J. Kepner, P. Aaltonen, D.\u2009A. Bader, A. Bulu\u00e7, F. Franchetti, J.\u2009R. Gilbert, D. Hutchison, M. Kumar, A. Lumsdaine, H. Meyerhenke, S. McMillan, C. Yang, J.\u2009D. Owens, M. Zalewski, T.\u2009G. Mattson, and J.\u2009E. Moreira, \u201cMathematical foundations of the graphblas,\u201d in HPEC 2016, pp.\u20091\u20139, IEEE, 2016.","DOI":"10.1109\/HPEC.2016.7761646"},{"key":"2023033120254880109_j_itit-2019-0032_ref_109_w2aab3b7d226b1b6b1ab2b1d109Aa","doi-asserted-by":"crossref","unstructured":"A. Bulu\u00e7, T. Mattson, S. McMillan, J.\u2009E. Moreira, and C. Yang, \u201cDesign of the graphblas API for C,\u201d in 2017 IEEE International Parallel and Distributed Processing Symposium Workshops, IPDPS Workshops 2017, pp.\u2009643\u2013652, 2017.","DOI":"10.1109\/IPDPSW.2017.117"},{"key":"2023033120254880109_j_itit-2019-0032_ref_110_w2aab3b7d226b1b6b1ab2b1d110Aa","doi-asserted-by":"crossref","unstructured":"T. Mattson, T.\u2009A. Davis, M. Kumar, A. Bulu\u00e7, S. McMillan, J.\u2009E. Moreira, and C. Yang, \u201cLagraph: A community effort to collect graph algorithms built on top of the graphblas,\u201d in IEEE International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2019, Rio de Janeiro, Brazil, May 20\u201324, 2019, pp.\u2009276\u2013284, IEEE, 2019.","DOI":"10.1109\/IPDPSW.2019.00053"},{"key":"2023033120254880109_j_itit-2019-0032_ref_111_w2aab3b7d226b1b6b1ab2b1d111Aa","doi-asserted-by":"crossref","unstructured":"J.\u2009D. Owens, \u201cTechnical perspective: Graphs, betweenness centrality, and the gpu,\u201d Commun. ACM, vol.\u200961, no.\u20098, p.\u200984, 2018.","DOI":"10.1145\/3230483"},{"key":"2023033120254880109_j_itit-2019-0032_ref_112_w2aab3b7d226b1b6b1ab2b1d112Aa","doi-asserted-by":"crossref","unstructured":"P.\u2009I. S\u00e1nchez, E. M\u00fcller, U.\u2009L. Korn, K. B\u00f6hm, A. Kappes, T. Hartmann, and D. Wagner, \u201cEfficient algorithms for a robust modularity-driven clustering of attributed graphs,\u201d in Proceedings of the 2015 SIAM International Conference on Data Mining, Vancouver, BC, Canada, April 30\u2013May 2, 2015 (S. Venkatasubramanian and J. Ye, eds.), pp.\u2009100\u2013108, SIAM, 2015.","DOI":"10.1137\/1.9781611974010.12"},{"key":"2023033120254880109_j_itit-2019-0032_ref_113_w2aab3b7d226b1b6b1ab2b1d113Aa","doi-asserted-by":"crossref","unstructured":"M. Potamias, F. Bonchi, A. Gionis, and G. Kollios, \u201cK-nearest neighbors in uncertain graphs,\u201d Proc. VLDB Endow., vol.\u20093, pp.\u2009997\u20131008, Sept 2010.","DOI":"10.14778\/1920841.1920967"}],"container-title":["it - Information Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyter.com\/view\/journals\/itit\/62\/3-4\/article-p189.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/itit-2019-0032\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/itit-2019-0032\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T09:29:49Z","timestamp":1680341389000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/itit-2019-0032\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,11]]},"references-count":113,"journal-issue":{"issue":"3-4","published-online":{"date-parts":[[2020,4,1]]},"published-print":{"date-parts":[[2020,5,27]]}},"alternative-id":["10.1515\/itit-2019-0032"],"URL":"https:\/\/doi.org\/10.1515\/itit-2019-0032","relation":{},"ISSN":["2196-7032","1611-2776"],"issn-type":[{"value":"2196-7032","type":"electronic"},{"value":"1611-2776","type":"print"}],"subject":[],"published":{"date-parts":[[2020,3,11]]}}}