{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T10:06:26Z","timestamp":1775815586502,"version":"3.50.1"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T00:00:00Z","timestamp":1559692800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T00:00:00Z","timestamp":1559692800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Data Sci Anal"],"published-print":{"date-parts":[[2020,4]]},"DOI":"10.1007\/s41060-019-00189-x","type":"journal-article","created":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T09:03:19Z","timestamp":1559725399000},"page":"257-272","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":50,"title":["Temporal betweenness centrality in dynamic graphs"],"prefix":"10.1007","volume":"9","author":[{"given":"Ioanna","family":"Tsalouchidou","sequence":"first","affiliation":[]},{"given":"Ricardo","family":"Baeza-Yates","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9464-8315","authenticated-orcid":false,"given":"Francesco","family":"Bonchi","sequence":"additional","affiliation":[]},{"given":"Kewen","family":"Liao","sequence":"additional","affiliation":[]},{"given":"Timos","family":"Sellis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,5]]},"reference":[{"key":"189_CR1","doi-asserted-by":"crossref","unstructured":"AlGhamdi, Z., Jamour, F., Skiadopoulos, S., Kalnis, P.: A benchmark for betweenness centrality approximation algorithms on large graphs. In: Proceedings of the 29th International Conference on Scientific and Statistical Database Management (SSDBM), p. 6 (2017)","DOI":"10.1145\/3085504.3085510"},{"key":"189_CR2","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s13278-011-0025-9","volume":"1","author":"CS Ang","year":"2011","unstructured":"Ang, C.S.: Interaction networks and patterns of guild community in massively multiplayer online games. Soc. Netw. Anal. Min. 1, 341 (2011)","journal-title":"Soc. Netw. Anal. Min."},{"key":"189_CR3","unstructured":"Anthonisse, J.: The rush in a directed graph. Technical Report, Stichting Mathematisch Centrum (1971)"},{"key":"189_CR4","doi-asserted-by":"crossref","unstructured":"Bergamini, E., Meyerhenke, H.: Fully-dynamic approximation of betweenness centrality. In: Algorithms-ESA 2015, pp. 155\u2013166. Springer, Berlin (2015)","DOI":"10.1007\/978-3-662-48350-3_14"},{"key":"189_CR5","unstructured":"Bergamini, E., Meyerhenke, H., Ortmann, M., Slobbe, A.: Faster betweenness centrality updates in evolving networks. In: 16th International Symposium on Experimental Algorithms, SEA 2017, June 21\u201323, 2017, pp. 23:1\u201323:16, London (2017)"},{"key":"189_CR6","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, 163\u2013177 (2001)","journal-title":"J. Math. Sociol."},{"key":"189_CR7","doi-asserted-by":"crossref","unstructured":"Brandes, U., Kenis, P., Lerner, J., van Raaij, D.: Network analysis of collaboration structure in Wikipedia. In: Proceedings of the 18th International Conference on World Wide Web, WWW 2009, Madrid, Spain, April 20\u201324, pp. 731\u2013740 (2009)","DOI":"10.1145\/1526709.1526808"},{"issue":"2","key":"189_CR8","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1142\/S0129054103001728","volume":"14","author":"B Bui-Xuan","year":"2003","unstructured":"Bui-Xuan, B., Ferreira, A., Jarry, A.: Computing shortest, fastest, and foremost journeys in dynamic networks. Int. J. Found. Comput. Sci. 14(2), 267\u2013285 (2003)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"189_CR9","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s13278-012-0060-1","volume":"3","author":"S Catanese","year":"2012","unstructured":"Catanese, S., Ferrara, E., Fiumara, G.: Forensic analysis of phone call networks. Soc. Netw. Anal. Min. 3, 15\u201333 (2012)","journal-title":"Soc. Netw. Anal. Min."},{"key":"189_CR10","doi-asserted-by":"publisher","first-page":"35","DOI":"10.2307\/3033543","volume":"40","author":"L Freeman","year":"1977","unstructured":"Freeman, L.: A set of measures of centrality based on betweenness. Sociometry 40, 35\u201341 (1977)","journal-title":"Sociometry"},{"key":"189_CR11","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. Natl. Acad. Sci. USA 99, 7821\u20137826 (2002)","journal-title":"Natl. Acad. Sci. USA"},{"key":"189_CR12","doi-asserted-by":"crossref","unstructured":"Goyal, A., Bonchi, F., Lakshmanan, L.V.S.: Learning influence probabilities in social networks. In: WSDM (2010)","DOI":"10.1145\/1718487.1718518"},{"key":"189_CR13","doi-asserted-by":"crossref","unstructured":"Green, O., McColl, R., Bader, D.A.: A fast algorithm for streaming betweenness centrality. In: Privacy, Security, Risk and Trust (PASSAT), 2012 International Conference on and 2012 International Conference on Social Computing (SocialCom), pp. 11\u201320 (2012)","DOI":"10.1109\/SocialCom-PASSAT.2012.37"},{"issue":"8","key":"189_CR14","doi-asserted-by":"publisher","first-page":"1133","DOI":"10.1007\/s10994-016-5583-7","volume":"106","author":"VM Gunturi","year":"2017","unstructured":"Gunturi, V.M., Shekhar, S., Joseph, K., Carley, K.M.: Scalable computational techniques for centrality metrics on temporally detailed social network. Mach. Learn. 106(8), 1133\u20131169 (2017)","journal-title":"Mach. Learn."},{"key":"189_CR15","unstructured":"Habiba, H., Tantipathananandh, C., Berger-Wolf, T.Y.: Betweenness centrality measure in dynamic networks. DIMACS Technical Report 2007-19 (2007)"},{"issue":"2","key":"189_CR16","doi-asserted-by":"publisher","first-page":"48","DOI":"10.14778\/2850578.2850580","volume":"9","author":"T Hayashi","year":"2015","unstructured":"Hayashi, T., Akiba, T., Yoshida, Y.: Fully dynamic betweenness centrality maintenance on massive networks. Proc. VLDB Endow. 9(2), 48\u201359 (2015)","journal-title":"Proc. VLDB Endow."},{"issue":"1","key":"189_CR17","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.jtbi.2010.11.033","volume":"271","author":"L Isella","year":"2011","unstructured":"Isella, L., Stehl\u00e9, J., Barrat, A., Cattuto, C., Pinton, J., Van den Broeck, W.: What\u2019s in a crowd? Analysis of face-to-face behavioral networks. J. Theor. Biol. 271(1), 166\u2013180 (2011)","journal-title":"J. Theor. Biol."},{"key":"189_CR18","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1109\/TPDS.2017.2763951","volume":"29","author":"F Jamour","year":"2018","unstructured":"Jamour, F., Skiadopoulos, S., Kalnis, P.: Parallel algorithm for incremental betweenness centrality on large graphs. IEEE Trans. Parallel Distrib. Syst. 29, 659\u2013672 (2018)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"189_CR19","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1038\/35075138","volume":"411","author":"H Jeong","year":"2001","unstructured":"Jeong, H., Mason, S., Barab\u00e1si, A., Oltvai, Z.: Lethality and centrality in protein networks. Nature 411, 41 (2001)","journal-title":"Nature"},{"key":"189_CR20","doi-asserted-by":"crossref","unstructured":"Kas, M., Wachs, M., Carley, K.M., Carley, L.R.: Incremental algorithm for updating betweenness centrality in dynamically growing networks. In: 2013 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), pp. 33\u201340 (2013)","DOI":"10.1145\/2492517.2492533"},{"key":"189_CR21","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. In: Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD\u201903 (2003)","DOI":"10.1145\/956750.956769"},{"issue":"4","key":"189_CR22","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1006\/jcss.2002.1829","volume":"64","author":"D Kempe","year":"2002","unstructured":"Kempe, D., Kleinberg, J.M., Kumar, A.: Connectivity and inference problems for temporal networks. J. Comput. Syst. Sci. 64(4), 820\u2013842 (2002)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"189_CR23","doi-asserted-by":"publisher","first-page":"026107","DOI":"10.1103\/PhysRevE.85.026107","volume":"85","author":"H Kim","year":"2012","unstructured":"Kim, H., Anderson, R.: Temporal node centrality in complex networks. Phys. Rev. E 85(2), 026107 (2012)","journal-title":"Phys. Rev. E"},{"issue":"9","key":"189_CR24","doi-asserted-by":"publisher","first-page":"2494","DOI":"10.1109\/TKDE.2015.2419666","volume":"27","author":"N Kourtellis","year":"2015","unstructured":"Kourtellis, N., Morales, G.D.F., Bonchi, F.: Scalable online betweenness centrality in evolving graphs. IEEE Trans. Knowl. Data Eng. 27(9), 2494\u20132506 (2015)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"189_CR25","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/j.ins.2015.07.053","volume":"326","author":"M-J Lee","year":"2016","unstructured":"Lee, M.-J., Choi, S., Chung, C.-W.: Efficient algorithms for updating betweenness centrality in fully dynamic graphs. Inf. Sci. 326, 278\u2013296 (2016)","journal-title":"Inf. Sci."},{"key":"189_CR26","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Huttenlocher, D.P., Kleinberg, J.M.: Governance in social media: a case study of the Wikipedia promotion process. In: Proceedings of the 4th International Conference on Weblogs and Social Media, ICWSM 2010, Washington, DC, USA, May 23\u201326 (2010)","DOI":"10.1609\/icwsm.v4i1.14013"},{"key":"189_CR27","doi-asserted-by":"publisher","first-page":"907","DOI":"10.1038\/35082140","volume":"411","author":"F Liljeros","year":"2001","unstructured":"Liljeros, F., Edling, C., Amaral, L., Stanley, H., Aberg, Y.: The web of human sexual contacts. Nature 411, 907 (2001)","journal-title":"Nature"},{"key":"189_CR28","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s13278-011-0029-5","volume":"2","author":"LA Maglaras","year":"2012","unstructured":"Maglaras, L.A., Katsaros, D.: New measures for characterizing the significance of nodes in wireless ad hoc networks via localized path-based neighborhood analysis. Soc. Netw. Anal. Min. 2, 97\u2013106 (2012)","journal-title":"Soc. Netw. Anal. Min."},{"key":"189_CR29","doi-asserted-by":"crossref","unstructured":"Mislove, A., Viswanath, B., Gummadi, K.P., Druschel, P.: You are who you know: inferring user profiles in online social networks. In: Proceedings of the 3rd ACM International Conference on Web Search and Data Mining, WSDM\u201910 (2010)","DOI":"10.1145\/1718487.1718519"},{"key":"189_CR30","doi-asserted-by":"crossref","unstructured":"Ni, P., Hanai, M., Tan, W.J., Wang, C., Cai, W.: Parallel algorithm for single-source earliest-arrival problem in temporal graphs. In: 2017 46th International Conference on Parallel Processing (ICPP), pp. 493\u2013502 (2017)","DOI":"10.1109\/ICPP.2017.58"},{"key":"189_CR31","unstructured":"Paranjape, A., Benson, A.R., Leskovec, J.: Motifs in temporal networks. In: Proceedings of the 10th ACM International Conference on Web Search and Data Mining, WSDM 2017, Cambridge, UK, February 6\u201310, 2017, pp. 601\u2013610 (2017)"},{"key":"189_CR32","unstructured":"Pereira, F.S.F., de Amo, S., Gama, J.: Evolving centralities in temporal graphs: a Twitter network analysis. In: IEEE 17th International Conference on Mobile Data Management, MDM2016, Porto, Portugal, June 13\u201316, 2016\u2014Workshops, pp. 43\u201348 (2016)"},{"key":"189_CR33","unstructured":"Pontecorvi, M., Ramachandran, V.: Fully dynamic betweenness centrality. In: Algorithms and Computation\u201426th International Symposium, ISAAC 2015, Nagoya, Japan, December 9\u201311, 2015, Proceedings, pp. 331\u2013342 (2015)"},{"key":"189_CR34","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1186\/s40649-017-0041-7","volume":"4","author":"AA Rad","year":"2017","unstructured":"Rad, A.A., Flocchini, P., Gaudet, J.: Computation and analysis of temporal betweenness in a knowledge mobilization network. Comput. Soc. Netw. 4, 5 (2017)","journal-title":"Comput. Soc. Netw."},{"key":"189_CR35","doi-asserted-by":"crossref","unstructured":"Riondato, M., Kornaropoulos, E.M.: Fast approximation of betweenness centrality through sampling. In: Proceedings of the 7th ACM International Conference on Web Search and Data Mining, WSDM\u201914, pp. 413\u2013422, New York (2014)","DOI":"10.1145\/2556195.2556224"},{"key":"189_CR36","doi-asserted-by":"crossref","unstructured":"Riondato, M., Upfal, E.: Abra: approximating betweenness centrality in static and dynamic graphs with rademacher averages. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1145\u20131154 (2016)","DOI":"10.1145\/2939672.2939770"},{"key":"189_CR37","first-page":"950","volume":"2014","author":"S Shekhar","year":"2014","unstructured":"Shekhar, S., Brugere, I., Gunturi, V.M.: Modeling and analysis of spatiotemporal social networks. Encycl. Soc. Netw. Anal. Min. 2014, 950\u2013960 (2014)","journal-title":"Encycl. Soc. Netw. Anal. Min."},{"key":"189_CR38","doi-asserted-by":"crossref","unstructured":"Tang, J., Musolesi, M., Mascolo, C., Latora, V., Nicosia, V.: Analysing information flows and key mediators through temporal centrality metrics. In: Proceedings of the 3rd Workshop on Social Network Systems, SNS\u201910, pp. 3:1\u20133:6, New York (2010)","DOI":"10.1145\/1852658.1852661"},{"key":"189_CR39","doi-asserted-by":"crossref","unstructured":"Viswanath, B., Mislove, A., Cha, M., Gummadi, P.K.: On the evolution of user interaction in Facebook. In: Proceedings of the 2nd ACM Workshop on Online Social Networks, WOSN 2009, Barcelona, Spain, August 17, pp. 37\u201342 (2009)","DOI":"10.1145\/1592665.1592675"},{"issue":"6","key":"189_CR40","first-page":"160","volume":"3","author":"MJ Williams","year":"2016","unstructured":"Williams, M.J., Musolesi, M.: Spatio-temporal networks: reachability, centrality and robustness. Open Sci. 3(6), 160\u2013196 (2016)","journal-title":"Open Sci."},{"issue":"9","key":"189_CR41","doi-asserted-by":"publisher","first-page":"721","DOI":"10.14778\/2732939.2732945","volume":"7","author":"H Wu","year":"2014","unstructured":"Wu, H., Cheng, J., Huang, S., Ke, Y., Lu, Y., Xu, Y.: Path problems in temporal graphs. Proc. VLDB Endow. 7(9), 721\u2013732 (2014)","journal-title":"Proc. VLDB Endow."},{"issue":"11","key":"189_CR42","doi-asserted-by":"publisher","first-page":"2927","DOI":"10.1109\/TKDE.2016.2594065","volume":"28","author":"H Wu","year":"2016","unstructured":"Wu, H., Cheng, J., Ke, Y., Huang, S., Huang, Y., Wu, H.: Efficient algorithms for temporal path computation. IEEE Trans. Knowl. Data Eng. 28(11), 2927\u20132942 (2016)","journal-title":"IEEE Trans. Knowl. Data Eng."}],"container-title":["International Journal of Data Science and Analytics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41060-019-00189-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s41060-019-00189-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41060-019-00189-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,17]],"date-time":"2023-09-17T06:11:12Z","timestamp":1694931072000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s41060-019-00189-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,5]]},"references-count":42,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,4]]}},"alternative-id":["189"],"URL":"https:\/\/doi.org\/10.1007\/s41060-019-00189-x","relation":{},"ISSN":["2364-415X","2364-4168"],"issn-type":[{"value":"2364-415X","type":"print"},{"value":"2364-4168","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,6,5]]},"assertion":[{"value":"20 November 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 May 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 June 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}