{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:03:17Z","timestamp":1758272597853,"version":"3.37.3"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2022,12,13]],"date-time":"2022-12-13T00:00:00Z","timestamp":1670889600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,12,13]],"date-time":"2022-12-13T00:00:00Z","timestamp":1670889600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100002322","name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","doi-asserted-by":"publisher","award":["001"],"award-info":[{"award-number":["001"]}],"id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["15\/24494-8"],"award-info":[{"award-number":["15\/24494-8"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004586","name":"Funda\u00e7\u00e3o Carlos Chagas Filho de Amparo \u00e0 Pesquisa do Estado do Rio de Janeiro","doi-asserted-by":"publisher","award":["E-26\/211.144\/2019","E-26\/202.689\/2018"],"award-info":[{"award-number":["E-26\/211.144\/2019","E-26\/202.689\/2018"]}],"id":[{"id":"10.13039\/501100004586","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2023,6]]},"DOI":"10.1007\/s00607-022-01137-7","type":"journal-article","created":{"date-parts":[[2022,12,13]],"date-time":"2022-12-13T12:04:07Z","timestamp":1670933047000},"page":"1271-1294","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Disjoint multipath closeness centrality"],"prefix":"10.1007","volume":"105","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5636-9956","authenticated-orcid":false,"given":"Mariana S. M.","family":"Barbosa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dianne S. V.","family":"Medeiros","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miguel Elias M.","family":"Campista","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,13]]},"reference":[{"key":"1137_CR1","doi-asserted-by":"crossref","unstructured":"Amaral P, Pinto PF, Bernardo L, et\u00a0al (2017) SDN based traffic engineering without optimization: a centrality based approach. In: Communications (ICC), 2017 IEEE international conference on, IEEE, p 1\u20137","DOI":"10.1109\/ICC.2017.7996841"},{"issue":"5","key":"1137_CR2","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1109\/MNET.2019.1900036","volume":"33","author":"AA Aouiz","year":"2019","unstructured":"Aouiz AA, Hacene SB, Lorenz P (2019) Channel busyness based multipath load balancing routing protocol for ad hoc networks. IEEE Netw 33(5):118\u2013125","journal-title":"IEEE Netw"},{"key":"1137_CR3","doi-asserted-by":"crossref","unstructured":"Barbosa MSM, Medeiros DSV, Campista MEM (2019) Centralidade de proximidade por m\u00faltiplos caminhos disjuntos: Aplica\u00e7\u00e3o em redes de longa dist\u00e2ncia. In: SBRC, p 88\u2013101","DOI":"10.5753\/sbrc.2019.7352"},{"issue":"3","key":"1137_CR4","doi-asserted-by":"publisher","first-page":"16","DOI":"10.17730\/humo.7.3.f4033344851gl053","volume":"7","author":"A Bavelas","year":"1948","unstructured":"Bavelas A (1948) A mathematical model for group structures. Human Organiz 7(3):16\u201330","journal-title":"Human Organiz"},{"issue":"6","key":"1137_CR5","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1121\/1.1906679","volume":"22","author":"A Bavelas","year":"1950","unstructured":"Bavelas A (1950) Communication patterns in task-oriented groups. J Acoust Soc Am 22(6):725\u2013730","journal-title":"J Acoust Soc Am"},{"issue":"2","key":"1137_CR6","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/j.jval.2016.12.011","volume":"20","author":"TG Bentley","year":"2017","unstructured":"Bentley TG, Cohen JT, Elkin EB et al (2017) Validity and reliability of value assessment frameworks for new cancer drugs. Val Health 20(2):200\u2013205","journal-title":"Val Health"},{"issue":"11","key":"1137_CR7","doi-asserted-by":"publisher","first-page":"1711","DOI":"10.1007\/s00607-018-0684-8","volume":"101","author":"K Berahmand","year":"2019","unstructured":"Berahmand K, Bouyer A, Samadi N (2019) A new local and multidimensional ranking measure to detect spreaders in social networks. Computing 101(11):1711\u20131733","journal-title":"Computing"},{"key":"1137_CR8","doi-asserted-by":"crossref","unstructured":"Bondy JA, Murty USR, et\u00a0al (1976) Graph theory with applications, vol 290. Citeseer","DOI":"10.1007\/978-1-349-03521-2"},{"issue":"4","key":"1137_CR9","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1016\/j.socnet.2005.11.005","volume":"28","author":"SP Borgatti","year":"2006","unstructured":"Borgatti SP, Everett MG (2006) A graph-theoretic perspective on centrality. Social Net 28(4):466\u2013484","journal-title":"Social Net"},{"issue":"6","key":"1137_CR10","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1002\/nem.1920","volume":"25","author":"M Bouet","year":"2015","unstructured":"Bouet M, Leguay J, Combe T et al (2015) Cost-based placement of VDPI functions in NFV infrastructures. Int J Netw Manag 25(6):490\u2013506","journal-title":"Int J Netw Manag"},{"key":"1137_CR11","doi-asserted-by":"crossref","unstructured":"Brandes U, Fleischer D (2005) Centrality measures based on current flow. In: STACS, p 533\u2013544","DOI":"10.1007\/978-3-540-31856-9_44"},{"issue":"2","key":"1137_CR12","doi-asserted-by":"publisher","first-page":"104","DOI":"10.5558\/tfc45104-2","volume":"45","author":"FM Buckingham","year":"1969","unstructured":"Buckingham FM (1969) The harmonic mean in forest mensuration. The Forest Chron 45(2):104\u2013106","journal-title":"The Forest Chron"},{"key":"1137_CR13","unstructured":"Comit\u00ea Gestor RNP (2007) Rede ip\u00ea: Pol\u00edtica de uso. In: Report, Rede Nacional de Pesquisa"},{"key":"1137_CR14","doi-asserted-by":"crossref","unstructured":"Couto RS, Secci S, Campista MEM, et\u00a0al (2014) Latency versus survivability in geo-distributed data center design. In: 2014 IEEE global communications conference, IEEE, p 1102\u20131107","DOI":"10.1109\/GLOCOM.2014.7036956"},{"issue":"4","key":"1137_CR15","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/s10260-010-0142-z","volume":"19","author":"C Croux","year":"2010","unstructured":"Croux C, Dehon C (2010) Influence functions of the spearman and kendall correlation measures. Stat Meth Appl 19(4):497\u2013515","journal-title":"Stat Meth Appl"},{"key":"1137_CR16","unstructured":"DANTE (2007) G\u00e9ant: Transforming the way researchers collaborate. In: Report, DANTE"},{"issue":"3","key":"1137_CR17","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","volume":"1","author":"LC Freeman","year":"1978","unstructured":"Freeman LC (1978) Centrality in social networks conceptual clarification. Social Netw 1(3):215\u2013239","journal-title":"Social Netw"},{"key":"1137_CR18","doi-asserted-by":"crossref","unstructured":"Grossi R, Marino A, Versari L (2018) Efficient algorithms for listing k disjoint st-paths in graphs. In: Latin American Symposium on Theoretical Informatics, Springer, p 544\u2013557","DOI":"10.1007\/978-3-319-77404-6_40"},{"issue":"5","key":"1137_CR19","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1511\/2006.61.3495","volume":"94","author":"B Hayes","year":"2006","unstructured":"Hayes B (2006) Connecting the dots. Am Scient 94(5):400\u2013404","journal-title":"Am Scient"},{"issue":"1","key":"1137_CR20","doi-asserted-by":"publisher","first-page":"18002","DOI":"10.1209\/0295-5075\/106\/18002","volume":"106","author":"ZL Hu","year":"2014","unstructured":"Hu ZL, Liu JG, Yang GY et al (2014) Effects of the distance among multiple spreaders on the spreading. EPL (Europhy Lett) 106(1):18002","journal-title":"EPL (Europhy Lett)"},{"issue":"3","key":"1137_CR21","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1214\/aoms\/1177732186","volume":"10","author":"MG Kendall","year":"1939","unstructured":"Kendall MG, Smith BB (1939) The problem of m rankings. Annals Math Stat 10(3):275\u2013287","journal-title":"Annals Math Stat"},{"key":"1137_CR22","doi-asserted-by":"crossref","unstructured":"Maccari L, Cigno RL (2016) Pop-routing: Centrality-based tuning of control messages for faster route convergence. In: Computer Communications, IEEE INFOCOM 2016-The 35th Annual IEEE international conference on, IEEE, p 1\u20139","DOI":"10.1109\/INFOCOM.2016.7524407"},{"issue":"3","key":"1137_CR23","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1109\/TNSE.2017.2708705","volume":"4","author":"DSV Medeiros","year":"2017","unstructured":"Medeiros DSV, Campista MEM, Mitton N et al (2017) The power of quasi-shortest paths: $$\\rho $$-geodesic betweenness centrality. IEEE Trans Netw Sci Eng 4(3):187\u2013200. https:\/\/doi.org\/10.1109\/TNSE.2017.2708705","journal-title":"IEEE Trans Netw Sci Eng"},{"key":"1137_CR24","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2019.2904008","author":"U Nakarmi","year":"2019","unstructured":"Nakarmi U, Rahnamay-Naeini M, Khamfroush H (2019) Critical component analysis in cascading failures for power grids using community structures in interaction graphs. IEEE Trans Netw Sci Eng. https:\/\/doi.org\/10.1109\/TNSE.2019.2904008","journal-title":"IEEE Trans Netw Sci Eng"},{"key":"1137_CR25","doi-asserted-by":"publisher","unstructured":"Newman MEJ (2006) Finding community structure in networks using the eigenvectors of matrices. Phys Rev E, 74:036104. https:\/\/doi.org\/10.1103\/PhysRevE.74.036104, https:\/\/link.aps.org\/doi\/10.1103\/PhysRevE.74.036104","DOI":"10.1103\/PhysRevE.74.036104"},{"issue":"1","key":"1137_CR26","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.socnet.2004.11.009","volume":"27","author":"MJ Newman","year":"2005","unstructured":"Newman MJ (2005) A measure of betweenness centrality based on random walks. Social Netw 27(1):39\u201354","journal-title":"Social Netw"},{"key":"1137_CR27","doi-asserted-by":"crossref","unstructured":"Rossi RA, Ahmed NK (2015) The network data repository with interactive graph analytics and visualization. In: AAAI, http:\/\/networkrepository.com","DOI":"10.1609\/aaai.v29i1.9277"},{"issue":"8","key":"1137_CR28","doi-asserted-by":"publisher","first-page":"1147","DOI":"10.1007\/s00607-018-0659-9","volume":"101","author":"N Samadi","year":"2019","unstructured":"Samadi N, Bouyer A (2019) Identifying influential spreaders based on edge ratio and neighborhood diversity measures in complex networks. Computing 101(8):1147\u20131175","journal-title":"Computing"},{"issue":"2","key":"1137_CR29","first-page":"217","volume":"50","author":"V Schafer","year":"2015","unstructured":"Schafer V (2015) Part of a whole: RENATER, a twenty-year-old network within the internet. Inf & Cult 50(2):217\u2013235","journal-title":"Inf & Cult"},{"issue":"1","key":"1137_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0378-8733(89)90016-6","volume":"11","author":"K Stephenson","year":"1989","unstructured":"Stephenson K, Zelen M (1989) Rethinking centrality: methods and examples. Social Netw 11(1):1\u201337","journal-title":"Social Netw"},{"issue":"9","key":"1137_CR31","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1037\/h0073158","volume":"24","author":"WH Taylor","year":"1933","unstructured":"Taylor WH (1933) The meaning of an average. J Educat Psychol 24(9):703","journal-title":"J Educat Psychol"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-022-01137-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00607-022-01137-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-022-01137-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,11]],"date-time":"2023-05-11T07:32:43Z","timestamp":1683790363000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00607-022-01137-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,13]]},"references-count":31,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["1137"],"URL":"https:\/\/doi.org\/10.1007\/s00607-022-01137-7","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"type":"print","value":"0010-485X"},{"type":"electronic","value":"1436-5057"}],"subject":[],"published":{"date-parts":[[2022,12,13]]},"assertion":[{"value":"4 March 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 November 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 December 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}