{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,22]],"date-time":"2026-03-22T20:54:47Z","timestamp":1774212887406,"version":"3.50.1"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,11,18]],"date-time":"2024-11-18T00:00:00Z","timestamp":1731888000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,18]],"date-time":"2024-11-18T00:00:00Z","timestamp":1731888000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Front. Comput. Sci."],"published-print":{"date-parts":[[2025,2]]},"DOI":"10.1007\/s11704-023-3424-y","type":"journal-article","created":{"date-parts":[[2024,11,18]],"date-time":"2024-11-18T07:29:15Z","timestamp":1731914955000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Labeling-based centrality approaches for identifying critical edges on temporal graphs"],"prefix":"10.1007","volume":"19","author":[{"given":"Tianming","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Jie","family":"Zhao","sequence":"additional","affiliation":[]},{"given":"Cibo","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Lu","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Yunjun","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Bin","family":"Cao","sequence":"additional","affiliation":[]},{"given":"Jing","family":"Fan","sequence":"additional","affiliation":[]},{"given":"Ge","family":"Yu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,11,18]]},"reference":[{"issue":"3","key":"3424_CR1","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","volume":"1","author":"L C Freeman","year":"1978","unstructured":"Freeman L C. Centrality in social networks conceptual clarification. Social Networks, 1978\u20131979, 1(3): 215\u2013239","journal-title":"Social Networks"},{"issue":"12","key":"3424_CR2","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. Community structure in social and biological networks. Proceedings of the National Academy of Sciences of the United States of America, 2002, 99(12): 7821\u20137826","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"},{"issue":"1","key":"3424_CR3","doi-asserted-by":"publisher","first-page":"11814","DOI":"10.1038\/s41598-022-15842-y","volume":"12","author":"M Pournajar","year":"2022","unstructured":"Pournajar M, Zaiser M, Moretti P. Edge betweenness centrality as a failure predictor in network models of structurally disordered materials. Scientific Reports, 2022, 12(1): 11814","journal-title":"Scientific Reports"},{"key":"3424_CR4","doi-asserted-by":"publisher","first-page":"1979","DOI":"10.29007\/7lxd","volume":"3","author":"A Simone","year":"2018","unstructured":"Simone A, Ridolfi L, Laucelli D, Berardi L, Giustolisi O. Centrality metrics for water distribution networks. EPiC Series in Engineering, 2018, 3: 1979\u20131988","journal-title":"EPiC Series in Engineering"},{"issue":"4","key":"3424_CR5","doi-asserted-by":"publisher","first-page":"1210","DOI":"10.1016\/j.jnca.2011.06.001","volume":"35","author":"A Cuzzocrea","year":"2012","unstructured":"Cuzzocrea A, Papadimitriou A, Katsaros D, Manolopoulos Y. Edge betweenness centrality: a novel algorithm for QoS-based topology control over wireless sensor networks. Journal of Network and Computer Applications, 2012, 35(4): 1210\u20131217","journal-title":"Journal of Network and Computer Applications"},{"key":"3424_CR6","first-page":"378","volume-title":"Proceedings of 2019 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining","author":"P Ni","year":"2019","unstructured":"Ni P, Hanai M, Tan W J, Cai W. Efficient closeness centrality computation in time-evolving graphs. In: Proceedings of 2019 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining. 2019, 378\u2013385"},{"issue":"3","key":"3424_CR7","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. International Journal of Data Science and Analytics, 2020, 9(3): 257\u2013272","journal-title":"International Journal of Data Science and Analytics"},{"key":"3424_CR8","series-title":"Dissertation","volume-title":"Temporal centralities: a study of the importance of nodes in dynamic graphs","author":"M Ghanem","year":"2018","unstructured":"Ghanem M. Temporal centralities: a study of the importance of nodes in dynamic graphs. Sorbonne Universit\u00e9s, Dissertation, 2018"},{"issue":"9","key":"3424_CR9","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. Proceedings of the VLDB Endowment, 2014, 7(9): 721\u2013732","journal-title":"Proceedings of the VLDB Endowment"},{"key":"3424_CR10","unstructured":"Saxena A, Iyengar S. Centrality measures in complex networks: a survey. 2020, arXiv preprint arXiv: 2011.07190"},{"issue":"1","key":"3424_CR11","doi-asserted-by":"publisher","first-page":"39","DOI":"10.7155\/jgaa.00081","volume":"8","author":"D Eppstein","year":"2004","unstructured":"Eppstein D, Wang J. Fast approximation of centrality. Journal of Graph Algorithms and Applications, 2004, 8(1): 39\u201345","journal-title":"Journal of Graph Algorithms and Applications"},{"issue":"301","key":"3424_CR12","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W Hoeffding","year":"1963","unstructured":"Hoeffding W. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 1963, 58(301): 13\u201330","journal-title":"Journal of the American Statistical Association"},{"key":"3424_CR13","first-page":"186","volume-title":"Proceedings of the 2nd Annual International Workshop on Frontiers in Algorithmics","author":"K Okamoto","year":"2008","unstructured":"Okamoto K, Chen W, Li X Y. Ranking of closeness centrality for large-scale social networks. In: Proceedings of the 2nd Annual International Workshop on Frontiers in Algorithmics. 2008, 186\u2013195"},{"key":"3424_CR14","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1145\/2660460.2660465","volume-title":"Proceedings of the 2nd ACM Conference on Online Social Networks","author":"E Cohen","year":"2014","unstructured":"Cohen E, Delling D, Pajor T, Werneck R F. Computing classic closeness centrality, at scale. In: Proceedings of the 2nd ACM Conference on Online Social Networks. 2014, 37\u201350"},{"key":"3424_CR15","first-page":"196","volume-title":"Proceedings of the 30th IEEE International Conference on Data Engineering","author":"P W Olsen","year":"2014","unstructured":"Olsen P W, Labouseur A G, Hwang J H. Efficient top-k closeness centrality search. In: Proceedings of the 30th IEEE International Conference on Data Engineering. 2014, 196\u2013207"},{"key":"3424_CR16","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1145\/2487788.2488055","volume-title":"Proceedings of the 22nd International Conference on World Wide Web","author":"A Guimar\u00e3es","year":"2013","unstructured":"Guimar\u00e3es A, Vieira A B, Silva A P C, Ziviani A. Fast centrality-driven diffusion in dynamic networks. In: Proceedings of the 22nd International Conference on World Wide Web. 2013, 821\u2013828"},{"key":"3424_CR17","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1007\/978-3-030-59416-9_32","volume-title":"Proceedings of the 25th International Conference on Database Systems for Advanced Applications","author":"Z Shao","year":"2020","unstructured":"Shao Z, Guo N, Gu Y, Wang Z, Li F, Yu G. Efficient closeness centrality computation for dynamic graphs. In: Proceedings of the 25th International Conference on Database Systems for Advanced Applications. 2020, 534\u2013550"},{"key":"3424_CR18","first-page":"402","volume-title":"Proceedings of 2020 IEEE International Conference on Data Mining","author":"L Oettershagen","year":"2020","unstructured":"Oettershagen L, Mutzel P. Efficient top-k temporal closeness calculation in temporal networks. In: Proceedings of 2020 IEEE International Conference on Data Mining. 2020, 402\u2013411"},{"issue":"2","key":"3424_CR19","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. Knowledge and Information Systems, 2022, 64(2): 507\u2013535","journal-title":"Knowledge and Information Systems"},{"issue":"5","key":"3424_CR20","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1145\/3344719","volume":"13","author":"E Bergamini","year":"2019","unstructured":"Bergamini E, Borassi M, Crescenzi P, Marino A, Meyerhenke H. Computing top-k closeness centrality faster in unweighted graphs. ACM Transactions on Knowledge Discovery from Data, 2019, 13(5): 53","journal-title":"ACM Transactions on Knowledge Discovery from Data"},{"issue":"2","key":"3424_CR21","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. The Journal of Mathematical Sociology, 2001, 25(2): 163\u2013177","journal-title":"The Journal of Mathematical Sociology"},{"key":"3424_CR22","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1137\/1.9781611974010.49","volume-title":"Proceedings of 2015 SIAM International Conference on Data Mining","author":"D Erd\u0151s","year":"2015","unstructured":"Erd\u0151s D, Ishakian V, Bestavros A, Terzi E. A divide-and-conquer algorithm for betweenness centrality. In: Proceedings of 2015 SIAM International Conference on Data Mining. 2015, 433\u2013441"},{"issue":"3","key":"3424_CR23","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1145\/3022668","volume":"11","author":"A E Sariy\u00fcce","year":"2017","unstructured":"Sariy\u00fcce A E, Kaya K, Saule E, \u00c7ataly\u00fcrek \u00dc V. Graph manipulations for fast centrality computation. ACM Transactions on Knowledge Discovery from Data, 2017, 11(3): 26","journal-title":"ACM Transactions on Knowledge Discovery from Data"},{"key":"3424_CR24","first-page":"450","volume-title":"Proceedings of 2012 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining","author":"M Baglioni","year":"2012","unstructured":"Baglioni M, Geraci F, Pellegrini M, Lastres E. Fast exact computation of betweenness centrality in social networks. In: Proceedings of 2012 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining. 2012, 450\u2013456"},{"issue":"1","key":"3424_CR25","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s13278-022-00876-x","volume":"12","author":"K Kanwar","year":"2022","unstructured":"Kanwar K, Kaushal S, Kumar H, Gupta G, Khari M. BCDCN: a new edge centrality measure to identify and rank critical edges pertaining to SIR diffusion in complex networks. Social Network Analysis and Mining, 2022, 12(1): 49","journal-title":"Social Network Analysis and Mining"},{"key":"3424_CR26","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/j.knosys.2012.01.007","volume":"30","author":"P De Meo","year":"2012","unstructured":"De Meo P, Ferrara E, Fiumara G, Ricciardello A. A novel measure of edge centrality in social networks. Knowledge-Based Systems, 2012, 30: 136\u2013150","journal-title":"Knowledge-Based Systems"},{"issue":"7","key":"3424_CR27","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. International Journal of Bifurcation and Chaos, 2007, 17(7): 2303\u20132318","journal-title":"International Journal of Bifurcation and Chaos"},{"key":"3424_CR28","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1145\/2556195.2556224","volume-title":"Proceedings of the 7th ACM International Conference on Web Search and Data Mining","author":"M Riondato","year":"2014","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. 2014, 413\u2013422"},{"key":"3424_CR29","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1145\/3447548.3467354","volume-title":"Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining","author":"C Cousins","year":"2021","unstructured":"Cousins C, Wohlgemuth C, Riondato M. Bavarian: betweenness centrality approximation with variance-aware rademacher averages. In: Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining. 2021, 196\u2013206"},{"key":"3424_CR30","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1145\/2187836.2187884","volume-title":"Proceedings of the 21st International Conference on World Wide Web","author":"M J Lee","year":"2012","unstructured":"Lee M J, Lee J, Park J Y, Choi R H, Chung C W. QUBE: a quick algorithm for updating betweenness centrality. In: Proceedings of the 21st International Conference on World Wide Web. 2012, 351\u2013360"},{"key":"3424_CR31","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1109\/SocialCom-PASSAT.2012.37","volume-title":"Proceedings of 2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing","author":"O Green","year":"2012","unstructured":"Green O, McColl R, Bader D A. A fast algorithm for streaming betweenness centrality. In: Proceedings of 2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing. 2012, 11\u201320"},{"issue":"9","key":"3424_CR32","doi-asserted-by":"publisher","first-page":"2494","DOI":"10.1109\/TKDE.2015.2419666","volume":"27","author":"N Kourtellis","year":"2015","unstructured":"Kourtellis N, De Francisci Morales G, Bonchi F. Scalable online betweenness centrality in evolving graphs. IEEE Transactions on Knowledge and Data Engineering, 2015, 27(9): 2494\u20132506","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"3424_CR33","first-page":"33","volume-title":"Proceedings of 2013 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining","author":"M Kas","year":"2013","unstructured":"Kas M, Wachs M, Carley K M, Carley L R. Incremental algorithm for updating betweenness centrality in dynamically growing networks. In: Proceedings of 2013 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining. 2013, 33\u201340"},{"key":"3424_CR34","first-page":"133","volume-title":"Proceedings of Meeting on Algorithm Engineering & Expermiments","author":"E Bergamini","year":"2015","unstructured":"Bergamini E, Meyerhenke H, Staudt C L. Approximating betweenness centrality in large evolving networks. In: Proceedings of Meeting on Algorithm Engineering & Expermiments. 2015, 133\u2013146"},{"issue":"2","key":"3424_CR35","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. Proceedings of the VLDB Endowment, 2015, 9(2): 48\u201359","journal-title":"Proceedings of the VLDB Endowment"},{"key":"3424_CR36","doi-asserted-by":"publisher","first-page":"2084","DOI":"10.1145\/3394486.3403259","volume-title":"Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining","author":"S Bu\u00df","year":"2020","unstructured":"Bu\u00df S, Molter H, Niedermeier R, Rymar M. Algorithmic aspects of temporal betweenness. In: Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. 2020, 2084\u20132092"},{"issue":"314","key":"3424_CR37","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1080\/01621459.1966.10480879","volume":"61","author":"W R Knight","year":"1966","unstructured":"Knight W R. A computer method for calculating Kendall\u2019s tau with ungrouped data. Journal of the American Statistical Association, 1966, 61(314): 436\u2013439","journal-title":"Journal of the American Statistical Association"}],"container-title":["Frontiers of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-023-3424-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11704-023-3424-y","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-023-3424-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,22]],"date-time":"2026-03-22T20:27:59Z","timestamp":1774211279000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11704-023-3424-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,18]]},"references-count":37,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["3424"],"URL":"https:\/\/doi.org\/10.1007\/s11704-023-3424-y","relation":{},"ISSN":["2095-2228","2095-2236"],"issn-type":[{"value":"2095-2228","type":"print"},{"value":"2095-2236","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11,18]]},"assertion":[{"value":"23 May 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 October 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 November 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Competing interests\n                      The authors declare that they have no competing interests or financial conflicts to disclose.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics"}}],"article-number":"192601"}}