{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:56:20Z","timestamp":1772121380328,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662483497","type":"print"},{"value":"9783662483503","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48350-3_14","type":"book-chapter","created":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T01:40:34Z","timestamp":1441071634000},"page":"155-166","source":"Crossref","is-referenced-by-count":23,"title":["Fully-Dynamic Approximation of Betweenness Centrality"],"prefix":"10.1007","author":[{"given":"Elisabetta","family":"Bergamini","sequence":"first","affiliation":[]},{"given":"Henning","family":"Meyerhenke","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,12]]},"reference":[{"key":"14_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-540-77004-6_10","volume-title":"Algorithms and Models for the Web-Graph","author":"D.A. Bader","year":"2007","unstructured":"Bader, D.A., Kintali, S., Madduri, K., Mihail, M.: Approximating betweenness centrality. In: Bonato, A., Chung, F.R.K. (eds.) WAW 2007. LNCS, vol.\u00a04863, pp. 124\u2013137. Springer, Heidelberg (2007)"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-642-02011-7_7","volume-title":"Experimental Algorithms","author":"R. Bauer","year":"2009","unstructured":"Bauer, R., Wagner, D.: Batch dynamic single-source shortest-path algorithms: An experimental study. In: Vahrenhold, J. (ed.) SEA 2009. LNCS, vol.\u00a05526, pp. 51\u201362. Springer, Heidelberg (2009)"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Bergamini, E., Meyerhenke, H.: Fully-dynamic approximation of betweenness centrality. CoRR, abs\/1504.07091 (2015)","DOI":"10.1007\/978-3-662-48350-3_14"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Bergamini, E., Meyerhenke, H., Staudt, C.: Approximating betweenness centrality in large evolving networks. In: 17th Workshop on Algorithm Engineering and Experiments, ALENEX 2015, pp. 133\u2013146. SIAM (2015)","DOI":"10.1137\/1.9781611973754.12"},{"key":"14_CR5","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. Journal of Mathematical Sociology\u00a025, 163\u2013177 (2001)","journal-title":"Journal of Mathematical Sociology"},{"issue":"7","key":"14_CR6","doi-asserted-by":"publisher","first-page":"2303","DOI":"10.1142\/S0218127407018403","volume":"17","author":"U. Brandes","year":"2007","unstructured":"Brandes, U., Pich, C.: Centrality estimation in large networks. I. J. Bifurcation and Chaos\u00a017(7), 2303\u20132318 (2007)","journal-title":"I. J. Bifurcation and Chaos"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/978-3-319-07959-2_24","volume-title":"Experimental Algorithms","author":"A. D\u2019Andrea","year":"2014","unstructured":"D\u2019Andrea, A., D\u2019Emidio, M., Frigioni, D., Leucci, S., Proietti, G.: Experimental evaluation of dynamic shortest path tree algorithms on homogeneous batches. In: Gudmundsson, J., Katajainen, J. (eds.) SEA 2014. LNCS, vol.\u00a08504, pp. 283\u2013294. Springer, Heidelberg (2014)"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/PL00009224","volume":"22","author":"D. Frigioni","year":"2008","unstructured":"Frigioni, D., Marchetti-Spaccamela, A., Nanni, U.: Semi-dynamic algorithms for maintaining single-source shortest path trees. Algorithmica\u00a022, 250\u2013274 (2008)","journal-title":"Algorithmica"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Geisberger, R., Sanders, P., Schultes, D.: Better approximation of betweenness centrality. In: 10th Workshop on Algorithm Engineering and Experiments, ALENEX 2008, pp. 90\u2013100. SIAM (2008)","DOI":"10.1137\/1.9781611972887.9"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-319-03536-9_14","volume-title":"Algorithms and Models for the Web Graph","author":"K. Goel","year":"2013","unstructured":"Goel, K., Singh, R.R., Iyengar, S., Sukrit: A faster algorithm to update betweenness centrality after node alteration. In: Bonato, A., Mitzenmacher, M., Pra\u0142at, P. (eds.) WAW 2013. LNCS, vol.\u00a08305, pp. 170\u2013184. Springer, Heidelberg (2013)"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Green, O., McColl, R., Bader, D.A.: A fast algorithm for streaming betweenness centrality. In: SocialCom\/PASSAT, pp. 11\u201320. IEEE (2012)","DOI":"10.1109\/SocialCom-PASSAT.2012.37"},{"issue":"1","key":"14_CR12","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s13278-014-0235-z","volume":"4","author":"M. Kas","year":"2014","unstructured":"Kas, M., Carley, K.M., Carley, L.R.: An incremental algorithm for updating betweenness centrality and k-betweenness centrality and its performance on realistic dynamic social network data. Social Netw. Analys. Mining\u00a04(1), 235 (2014)","journal-title":"Social Netw. Analys. Mining"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Kourtellis, N., De Francisci Morales, G., Bonchi, F.: Scalable online betweenness centrality in evolving graphs. IEEE Transactions on Knowledge and Data Engineering\u00a0(99), 1 (2015)","DOI":"10.1109\/ICDE.2016.7498421"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Kunegis, J.: KONECT: the koblenz network collection. In: 22nd Int. World Wide Web Conf., WWW 2013, pp. 1343\u20131350 (2013)","DOI":"10.1145\/2487788.2488173"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Lee, M., Lee, J., Park, J.Y., Choi, R.H., Chung, C.: QUBE: a quick algorithm for updating betweenness centrality. In: 21st World Wide Web Conf. 2012, WWW 2012, pp. 351\u2013360. ACM (2012)","DOI":"10.1145\/2187836.2187884"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Kleinberg, J.M., Faloutsos, C.: Graphs over time: densification laws, shrinking diameters and possible explanations. In: 11th Int. Conf. on Knowledge Discovery and Data Mining, pp. 177\u2013187. ACM (2005)","DOI":"10.1145\/1081870.1081893"},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1007\/978-3-662-44465-8_49","volume-title":"Mathematical Foundations of Computer Science 2014","author":"M. Nasre","year":"2014","unstructured":"Nasre, M., Pontecorvi, M., Ramachandran, V.: Betweenness centrality \u2013 incremental and faster. In: Csuhaj-Varj\u00fa, E., Dietzfelbinger, M., \u00c9sik, Z. (eds.) MFCS 2014, Part II. LNCS, vol.\u00a08635, pp. 577\u2013588. Springer, Heidelberg (2014)"},{"key":"14_CR18","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1006\/jagm.1996.0046","volume":"21","author":"G. Ramalingam","year":"1992","unstructured":"Ramalingam, G., Reps, T.: An incremental algorithm for a generalization of the shortest-path problem. Journal of Algorithms\u00a021, 267\u2013305 (1992)","journal-title":"Journal of Algorithms"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Riondato, M., Kornaropoulos, E.M.: Fast approximation of betweenness centrality through sampling. In: 7th ACM Int. Conf. on Web Search and Data Mining (WSDM 2014), pp. 413\u2013422. ACM (2014)","DOI":"10.1145\/2556195.2556224"},{"issue":"2","key":"14_CR20","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/s00453-010-9401-5","volume":"61","author":"L. Roditty","year":"2011","unstructured":"Roditty, L., Zwick, U.: On dynamic shortest paths problems. Algorithmica\u00a061(2), 389\u2013401 (2011)","journal-title":"Algorithmica"},{"key":"14_CR21","unstructured":"von Looz, M., Staudt, C.L., Meyerhenke, H., Prutkin, R.: Fast generation of complex networks with underlying hyperbolic geometry (2015), \n                    \n                      http:\/\/arxiv.org\/abs\/1501.03545v2"},{"key":"14_CR22","unstructured":"Staudt, C., Sazonovs, A., Meyerhenke, H.: NetworKit: An interactive tool suite for high-performance network analysis (2014), \n                    \n                      http:\/\/arxiv.org\/abs\/1403.3005"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2015"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48350-3_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:57:12Z","timestamp":1559246232000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48350-3_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662483497","9783662483503"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48350-3_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}