{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T07:24:05Z","timestamp":1774250645422,"version":"3.50.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T00:00:00Z","timestamp":1774224000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T00:00:00Z","timestamp":1774224000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003819","name":"Natural Science Foundation of Hubei Province","doi-asserted-by":"publisher","award":["JCZRYB202500322"],"award-info":[{"award-number":["JCZRYB202500322"]}],"id":[{"id":"10.13039\/501100003819","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["World Wide Web"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1007\/s11280-026-01412-z","type":"journal-article","created":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T06:29:19Z","timestamp":1774247359000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Historical betweenness centrality and its computation"],"prefix":"10.1007","volume":"29","author":[{"given":"Zhenyu","family":"Mao","sequence":"first","affiliation":[]},{"given":"Ming","family":"Zhong","sequence":"additional","affiliation":[]},{"given":"Yuanyuan","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Tieyun","family":"Qian","sequence":"additional","affiliation":[]},{"given":"Mengchi","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Jeffrey Xu","family":"Yu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,3,23]]},"reference":[{"key":"1412_CR1","doi-asserted-by":"publisher","unstructured":"Zhang, T., Gao, Y., Zhao, J., Chen, L., Jin, L., Yang, Z., Cao, B., Fan, J.: Efficient exact and approximate betweenness centrality computation for temporal graphs. In: Proceedings of the ACM Web conference 2024. WWW \u201924, pp. 2395\u20132406. Association for Computing Machinery, New York, NY, USA (2024). https:\/\/doi.org\/10.1145\/3589334.3645438","DOI":"10.1145\/3589334.3645438"},{"key":"1412_CR2","doi-asserted-by":"publisher","unstructured":"Santoro, D., Sarpe, I.: Onbra: Rigorous estimation of the temporal betweenness centrality in temporal networks. In: Proceedings of the ACM web conference 2022. WWW \u201922, pp. 1579\u20131588. Association for Computing Machinery, New York, NY, USA (2022). https:\/\/doi.org\/10.1145\/3485447.3512204","DOI":"10.1145\/3485447.3512204"},{"key":"1412_CR3","unstructured":"Dekker, A.H.: Network centrality and super-spreaders in infectious disease epidemiology. (2013). https:\/\/api.semanticscholar.org\/CorpusID:85534195"},{"issue":"1","key":"1412_CR4","doi-asserted-by":"publisher","first-page":"4919","DOI":"10.1038\/s41598-021-84418-z","volume":"11","author":"S Zaoli","year":"2021","unstructured":"Zaoli, S., Mazzarisi, P., Lillo, F.: Betweenness centrality for temporal multiplexes. Sci. Rep. 11(1), 4919 (2021). https:\/\/doi.org\/10.1038\/s41598-021-84418-z","journal-title":"Sci. Rep."},{"key":"1412_CR5","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.98.062413","volume":"98","author":"VV Makarov","year":"2018","unstructured":"Makarov, V.V., Zhuravlev, M.O., Runnova, A.E., Protasov, P., Maksimenko, V.A., Frolov, N.S., Pisarchik, A.N., Hramov, A.E.: Betweenness centrality in multiplex brain network during mental task evaluation. Phys. Rev. E 98, 062413 (2018). https:\/\/doi.org\/10.1103\/PhysRevE.98.062413","journal-title":"Phys. Rev. E"},{"key":"1412_CR6","doi-asserted-by":"publisher","unstructured":"Semertzidis, K., Lili, K., Pitoura, E.: Timereach: Historical reachability queries on evolving graphs. (2015). https:\/\/doi.org\/10.5441\/002\/edbt.2015.01","DOI":"10.5441\/002\/edbt.2015.01"},{"key":"1412_CR7","doi-asserted-by":"publisher","unstructured":"Brandes, U.: A faster algorithm for betweenness centrality. J. Math. Sociol. 25, (2004). https:\/\/doi.org\/10.1080\/0022250X.2001.9990249","DOI":"10.1080\/0022250X.2001.9990249"},{"key":"1412_CR8","doi-asserted-by":"publisher","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 \u201917. Association for Computing Machinery, New York, NY, USA (2017). https:\/\/doi.org\/10.1145\/3085504.3085510","DOI":"10.1145\/3085504.3085510"},{"key":"1412_CR9","doi-asserted-by":"publisher","unstructured":"Borassi, M., Natale, E.: Kadabra is an adaptive algorithm for betweenness via random approximation. ACM J. Exp. Algorithmics 24, (2019). https:\/\/doi.org\/10.1145\/3284359","DOI":"10.1145\/3284359"},{"issue":"07","key":"1412_CR10","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. Int. J. Bifurcation Chaos 17(07), 2303\u20132318 (2007). https:\/\/doi.org\/10.1142\/S0218127407018403","journal-title":"Int. J. Bifurcation Chaos"},{"key":"1412_CR11","doi-asserted-by":"publisher","unstructured":"Cousins, C., Wohlgemuth, C., Riondato, M.: Bavarian: Betweenness centrality approximation with variance-aware rademacher averages. ACM Trans. Knowl. Discov. Data 17(6) (2023). https:\/\/doi.org\/10.1145\/3577021","DOI":"10.1145\/3577021"},{"key":"1412_CR12","doi-asserted-by":"crossref","unstructured":"Jacob, R., Kosch\u00fctzki, D., Zweig, K.A., Peeters, L., Tenfelde-Podehl, D.: Algorithms for centrality indices. In: Network Analysis (2004). https:\/\/api.semanticscholar.org\/CorpusID:26768690","DOI":"10.1007\/978-3-540-31955-9_4"},{"key":"1412_CR13","doi-asserted-by":"publisher","unstructured":"Pellegrina, L., Vandin, F.: Silvan: Estimating betweenness centralities with progressive sampling and non-uniform rademacher bounds. ACM Trans. Knowl. Discov. Data 18(3) (2023). https:\/\/doi.org\/10.1145\/3628601","DOI":"10.1145\/3628601"},{"key":"1412_CR14","doi-asserted-by":"publisher","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. Association for Computing Machinery, New York, NY, USA (2014). https:\/\/doi.org\/10.1145\/2556195.2556224","DOI":"10.1145\/2556195.2556224"},{"key":"1412_CR15","doi-asserted-by":"publisher","unstructured":"Riondato, M., Upfal, E.: Abra: Approximating betweenness centrality in static and dynamic graphs with rademacher averages. ACM Trans. Knowl. Discov. Data 12(5) (2018). https:\/\/doi.org\/10.1145\/3208351","DOI":"10.1145\/3208351"},{"key":"1412_CR16","doi-asserted-by":"publisher","unstructured":"Xu, W., Mao, H., Shao, H., Liang, W., Peng, J., Huang, W., Xu, Z., Zhou, P., Yu, J.X.: An Adaptive Sampling Algorithm for the Top-K Group Betweenness Centrality. In: 2025 IEEE 41st International Conference on Data Engineering (ICDE), pp. 170\u2013182. IEEE Computer Society, Los Alamitos, CA, USA (2025). https:\/\/doi.org\/10.1109\/ICDE65448.2025.00020","DOI":"10.1109\/ICDE65448.2025.00020"},{"key":"1412_CR17","doi-asserted-by":"publisher","unstructured":"Alsayed, A., Higham, D.J.: Betweenness in time dependent networks. Chaos, Solit. Fract. 72, 35\u201348 (2015). https:\/\/doi.org\/10.1016\/j.chaos.2014.12.009. Multiplex Networks: Structure, Dynamics and Applications","DOI":"10.1016\/j.chaos.2014.12.009"},{"key":"1412_CR18","doi-asserted-by":"publisher","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, 026107 (2012). https:\/\/doi.org\/10.1103\/PhysRevE.85.026107","journal-title":"Phys. Rev. E"},{"issue":"3","key":"1412_CR19","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s41060-019-00189-x","volume":"9","author":"I Tsalouchidou","year":"2020","unstructured":"Tsalouchidou, I., Baeza-Yates, R., Bonchi, F., Liao, K., Sellis, T.: Temporal betweenness centrality in dynamic graphs. Int. J. Data Sci. Anal. 9(3), 257\u2013272 (2020). https:\/\/doi.org\/10.1007\/s41060-019-00189-x","journal-title":"Int. J. Data Sci. Anal."},{"issue":"2","key":"1412_CR20","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1017\/nws.2024.5","volume":"12","author":"S Bu\u00df","year":"2024","unstructured":"Bu\u00df, S., Molter, H., Niedermeier, R., Rymar, M.: Algorithmic aspects of temporal betweenness. Netw. Sci. 12(2), 160\u2013188 (2024). https:\/\/doi.org\/10.1017\/nws.2024.5","journal-title":"Netw. Sci."},{"key":"1412_CR21","doi-asserted-by":"publisher","unstructured":"Nicosia, V., Tang, J., Mascolo, C., Musolesi, M., Russo, G., Latora, V.. In: Holme, P., Saram\u00e4ki, J. (eds.) Graph Metrics for Temporal Networks, pp. 15\u201340. Springer, Berlin, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36461-7_2","DOI":"10.1007\/978-3-642-36461-7_2"},{"key":"1412_CR22","doi-asserted-by":"publisher","unstructured":"Tang, J., Leontiadis, I., Scellato, S., Nicosia, V., Mascolo, C., Musolesi, M., Latora, V.: Applications of Temporal Graph Metrics to Real-World Networks, pp. 135\u2013159. Springer, (2013). https:\/\/doi.org\/10.1007\/978-3-642-36461-7_7","DOI":"10.1007\/978-3-642-36461-7_7"},{"key":"1412_CR23","doi-asserted-by":"publisher","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. Association for Computing Machinery, New York, NY, USA (2010). https:\/\/doi.org\/10.1145\/1852658.1852661","DOI":"10.1145\/1852658.1852661"},{"key":"1412_CR24","doi-asserted-by":"publisher","unstructured":"Crescenzi, P., Magnien, C., Marino, A.: Finding top-k nodes for temporal closeness in large temporal graphs. Algorithms 13(9) (2020). https:\/\/doi.org\/10.3390\/a13090211","DOI":"10.3390\/a13090211"},{"key":"1412_CR25","doi-asserted-by":"publisher","unstructured":"Oettershagen, L., Mutzel, P.: Efficient top-k temporal closeness calculation in temporal networks. In: 2020 IEEE International Conference on Data Mining (ICDM), pp. 402\u2013411 (2020). https:\/\/doi.org\/10.1109\/ICDM50108.2020.00049","DOI":"10.1109\/ICDM50108.2020.00049"},{"key":"1412_CR26","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.84.016105","volume":"84","author":"RK Pan","year":"2011","unstructured":"Pan, R.K., Saram\u00e4ki, J.: Path lengths, correlations, and centrality in temporal networks. Phys. Rev. E 84, 016105 (2011). https:\/\/doi.org\/10.1103\/PhysRevE.84.016105","journal-title":"Phys. Rev. E"},{"key":"1412_CR27","unstructured":"Santoro, N., Quattrociocchi, W., Flocchini, P., Casteigts, A., Amblard, F.: Time-varying graphs and social network analysis: Temporal indicators and metrics. arxiv:1102.0629 (2011)"},{"key":"1412_CR28","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/s10115-021-01639-4","volume":"64","author":"L Oettershagen","year":"2022","unstructured":"Oettershagen, L., Mutzel, P.: Computing top-k temporal closeness in temporal networks. Knowl. Inf. Syst. 64, 507\u2013535 (2022). https:\/\/doi.org\/10.1007\/s10115-021-01639-4","journal-title":"Knowl. Inf. Syst."},{"issue":"1","key":"1412_CR29","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF02289026","volume":"18","author":"L Katz","year":"1953","unstructured":"Katz, L.: A new status index derived from sociometric analysis. Psychometrika 18(1), 39\u201343 (1953)","journal-title":"Psychometrika"},{"issue":"32","key":"1412_CR30","first-page":"26","volume":"3","author":"F B\u00e9res","year":"2018","unstructured":"B\u00e9res, F., P\u00e1lovics, R., Ol\u00e1h, A., Bencz\u00far, A.A.: Temporal walk based centrality metric for graph streams. Appl. Netw. Sci. 3(32), 26 (2018)","journal-title":"Appl. Netw. Sci."},{"key":"1412_CR31","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.83.046120","volume":"83","author":"P Grindrod","year":"2011","unstructured":"Grindrod, P., Parsons, M.C., Higham, D.J., Estrada, E.: Communicability across evolving networks. Phys. Rev. E 83, 046120 (2011). https:\/\/doi.org\/10.1103\/PhysRevE.83.046120","journal-title":"Phys. Rev. E"},{"key":"1412_CR32","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1007\/978-3-319-46227-1_42","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"P Rozenshtein","year":"2016","unstructured":"Rozenshtein, P., Gionis, A.: Temporal pagerank. In: Frasconi, P., Landwehr, N., Manco, G., Vreeken, J. (eds.) Machine Learning and Knowledge Discovery in Databases, pp. 674\u2013689. Springer, Cham (2016)"},{"key":"1412_CR33","doi-asserted-by":"publisher","unstructured":"Oettershagen, L., Kriege, N.M., Mutzel, P.: A higher-order temporal h-index for evolving networks. In: Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. KDD \u201923, pp. 1770\u20131782. Association for Computing Machinery, New York, NY, USA (2023). https:\/\/doi.org\/10.1145\/3580305.3599242","DOI":"10.1145\/3580305.3599242"},{"issue":"9","key":"1412_CR34","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). https:\/\/doi.org\/10.14778\/2732939.2732945","journal-title":"Proc. VLDB Endow."}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-026-01412-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11280-026-01412-z","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-026-01412-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T06:29:22Z","timestamp":1774247362000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11280-026-01412-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,23]]},"references-count":34,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["1412"],"URL":"https:\/\/doi.org\/10.1007\/s11280-026-01412-z","relation":{},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"value":"1386-145X","type":"print"},{"value":"1573-1413","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,23]]},"assertion":[{"value":"4 December 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 February 2026","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 March 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 March 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}],"article-number":"25"}}