{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T14:31:35Z","timestamp":1760711495084,"version":"3.40.4"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,4,15]],"date-time":"2025-04-15T00:00:00Z","timestamp":1744675200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,4,15]],"date-time":"2025-04-15T00:00:00Z","timestamp":1744675200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"name":"This work is funded in part by the ANR (French National Agency of Research) through the ANR FiT LabCom."},{"name":"This work is funded in part by the DAAD."}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Netw Sci"],"DOI":"10.1007\/s41109-024-00685-5","type":"journal-article","created":{"date-parts":[[2025,4,15]],"date-time":"2025-04-15T11:15:06Z","timestamp":1744715706000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Temporal betweenness centrality on shortest walks variants"],"prefix":"10.1007","volume":"10","author":[{"given":"Mehdi","family":"Naima","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,4,15]]},"reference":[{"key":"685_CR1","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.entcs.2016.03.005","volume":"322","author":"M Borassi","year":"2016","unstructured":"Borassi M, Crescenzi P, Habib M (2016) Into the square: on the complexity of some quadratic-time solvable problems. Electron Notes Theoret Comput Sci 322:51\u201367","journal-title":"Electron Notes Theoret Comput Sci"},{"issue":"2","key":"685_CR2","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1080\/0022250X.2001.9990249","volume":"25","author":"U Brandes","year":"2001","unstructured":"Brandes U (2001) A faster algorithm for betweenness centrality. J Math Sociol 25(2):163\u2013177","journal-title":"J Math Sociol"},{"key":"685_CR3","doi-asserted-by":"crossref","unstructured":"Burt RS (2004) From structural holes: the social structure of competition. New Econ Sociol Reader, pp 325\u2013348","DOI":"10.1515\/9780691229270-013"},{"key":"685_CR4","doi-asserted-by":"crossref","unstructured":"Bu\u00df S, Molter H, Niedermeier R et\u00a0al (2020) Algorithmic aspects of temporal betweenness. In: Proceedings of the 26th ACM SIGKDD international conference on knowledge discovery & data mining, pp 2084\u20132092","DOI":"10.1145\/3394486.3403259"},{"issue":"9","key":"685_CR5","doi-asserted-by":"publisher","first-page":"2754","DOI":"10.1007\/s00453-021-00831-w","volume":"83","author":"A Casteigts","year":"2021","unstructured":"Casteigts A, Himmel AS, Molter H et al (2021) Finding temporal paths under waiting time constraints. Algorithmica 83(9):2754\u20132802","journal-title":"Algorithmica"},{"key":"685_CR6","unstructured":"Cruciani A (2023) On approximating the temporal betweenness centrality through sampling. arXiv preprint arXiv:2304.08356"},{"key":"685_CR7","doi-asserted-by":"crossref","unstructured":"Freeman LC (1977) A set of measures of centrality based on betweenness. Sociometry, pp 35\u201341","DOI":"10.2307\/3033543"},{"issue":"12","key":"685_CR8","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan M, Newman ME (2002) Community structure in social and biological networks. Proc Natl Acad Sci 99(12):7821\u20137826","journal-title":"Proc Natl Acad Sci"},{"issue":"2","key":"685_CR9","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.85.026107","volume":"85","author":"H Kim","year":"2012","unstructured":"Kim H, Anderson R (2012) Temporal node centrality in complex networks. Phys Rev E 85(2):026107","journal-title":"Phys Rev E"},{"issue":"6","key":"685_CR10","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1016\/j.physa.2008.11.021","volume":"388","author":"V Kostakos","year":"2009","unstructured":"Kostakos V (2009) Temporal graphs. Phys A 388(6):1007\u20131023","journal-title":"Phys A"},{"issue":"1","key":"685_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/sdata.2018.89","volume":"5","author":"R Kujala","year":"2018","unstructured":"Kujala R, Weckstr\u00f6m C, Darst RK et al (2018) A collection of public transport network data sets for 25 cities. Sci Data 5(1):1\u201314","journal-title":"Sci Data"},{"issue":"1","key":"685_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13278-018-0537-7","volume":"8","author":"M Latapy","year":"2018","unstructured":"Latapy M, Viard T, Magnien C (2018) Stream graphs and link streams for the modeling of interactions over time. Soc Netw Anal Min 8(1):1\u201329","journal-title":"Soc Netw Anal Min"},{"issue":"9","key":"685_CR13","doi-asserted-by":"publisher","first-page":"1303","DOI":"10.1002\/asi.20614","volume":"58","author":"L Leydesdorff","year":"2007","unstructured":"Leydesdorff L (2007) Betweenness centrality as an indicator of the interdisciplinarity of scientific journals. J Am Soc Inform Sci Technol 58(9):1303\u20131319","journal-title":"J Am Soc Inform Sci Technol"},{"key":"685_CR14","doi-asserted-by":"crossref","unstructured":"Magnien C, Tarissan F (2015) Time evolution of the importance of nodes in dynamic networks. In: Proceedings of the 2015 IEEE\/ACM international conference on advances in social networks analysis and mining 2015, pp 1200\u20131207","DOI":"10.1145\/2808797.2809322"},{"key":"685_CR15","unstructured":"Narayanan S (2005) The betweenness centrality of biological networks. PhD thesis, Virginia Tech"},{"issue":"1","key":"685_CR16","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1080\/15472450.2012.716663","volume":"17","author":"R Puzis","year":"2013","unstructured":"Puzis R, Altshuler Y, Elovici Y et al (2013) Augmented betweenness centrality for environmentally aware traffic monitoring in transportation networks. J Intell Transp Syst 17(1):91\u2013105","journal-title":"J Intell Transp Syst"},{"key":"685_CR17","doi-asserted-by":"crossref","unstructured":"Rymar M, Molter H, Nichterlein A et\u00a0al (2021) Towards classifying the polynomial-time solvability of temporal betweenness centrality. In: international workshop on graph-theoretic concepts in computer science, Springer, pp 219\u2013231","DOI":"10.1007\/978-3-030-86838-3_17"},{"key":"685_CR18","first-page":"1579","volume":"2022","author":"D Santoro","year":"2022","unstructured":"Santoro D, Sarpe I (2022) Onbra: rigorous estimation of the temporal betweenness centrality in temporal networks. Proc ACM Web Conf 2022:1579\u20131588","journal-title":"Proc ACM Web Conf"},{"key":"685_CR19","unstructured":"Simard F, Magnien C, Latapy M (2021) Computing betweenness centrality in link streams. arXiv preprint arXiv:2102.06543"},{"key":"685_CR20","doi-asserted-by":"crossref","unstructured":"Tang J, Musolesi M, Mascolo C et\u00a0al (2010) Analysing information flows and key mediators through temporal centrality metrics. In: Proceedings of the 3rd workshop on social network systems, pp 1\u20136","DOI":"10.1145\/1852658.1852661"},{"key":"685_CR21","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 et al (2020) Temporal betweenness centrality in dynamic graphs. Int J Data Sci Anal 9:257\u2013272","journal-title":"Int J Data Sci Anal"},{"issue":"24","key":"685_CR22","doi-asserted-by":"publisher","first-page":"3106","DOI":"10.1093\/bioinformatics\/btl533","volume":"22","author":"J Yoon","year":"2006","unstructured":"Yoon J, Blumer A, Lee K (2006) An algorithm for modularity analysis of directed and weighted biological networks based on edge-betweenness centrality. Bioinformatics 22(24):3106\u20133108","journal-title":"Bioinformatics"}],"container-title":["Applied Network Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-024-00685-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41109-024-00685-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-024-00685-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,15]],"date-time":"2025-04-15T11:15:14Z","timestamp":1744715714000},"score":1,"resource":{"primary":{"URL":"https:\/\/appliednetsci.springeropen.com\/articles\/10.1007\/s41109-024-00685-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,15]]},"references-count":22,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["685"],"URL":"https:\/\/doi.org\/10.1007\/s41109-024-00685-5","relation":{},"ISSN":["2364-8228"],"issn-type":[{"value":"2364-8228","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,4,15]]},"assertion":[{"value":"6 October 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 November 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 April 2025","order":3,"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":"11"}}