{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T22:07:40Z","timestamp":1777500460265,"version":"3.51.4"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,11,23]],"date-time":"2019-11-23T00:00:00Z","timestamp":1574467200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,11,23]],"date-time":"2019-11-23T00:00:00Z","timestamp":1574467200000},"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":["Comput Math Organ Theory"],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1007\/s10588-019-09301-9","type":"journal-article","created":{"date-parts":[[2019,11,23]],"date-time":"2019-11-23T17:02:57Z","timestamp":1574528577000},"page":"55-87","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["k-step betweenness centrality"],"prefix":"10.1007","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7580-8352","authenticated-orcid":false,"given":"Melda Kevser","family":"Akg\u00fcn","sequence":"first","affiliation":[]},{"given":"Mustafa Kemal","family":"Tural","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,23]]},"reference":[{"issue":"5439","key":"9301_CR1","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"AL Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si AL, Albert R (1999) Emergence of scaling in random networks. Science 286(5439):509\u2013512. https:\/\/doi.org\/10.1126\/science.286.5439.509","journal-title":"Science"},{"key":"9301_CR2","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1016\/j.socnet.2005.11.005","volume":"28","author":"S Borgatti","year":"2006","unstructured":"Borgatti S, Everett M (2006) A graph-theoretic perspective on centrality. Soc Netw 28:466\u2013484. https:\/\/doi.org\/10.1016\/j.socnet.2005.11.005","journal-title":"Soc Netw"},{"issue":"2","key":"9301_CR3","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. https:\/\/doi.org\/10.1080\/0022250X.2001.9990249","journal-title":"J Math Sociol"},{"issue":"2","key":"9301_CR4","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/j.socnet.2007.11.001","volume":"30","author":"U Brandes","year":"2008","unstructured":"Brandes U (2008) On variants of shortest-path betweenness centrality and their generic computation. Soc Netw 30(2):136\u2013145. https:\/\/doi.org\/10.1016\/j.socnet.2007.11.001","journal-title":"Soc Netw"},{"key":"9301_CR5","unstructured":"Chen W, Lu W, Zhang N (2012) Time-critical influence maximization in social networks with time-delayed diffusion process. In: Proceedings of the twenty-sixth AAAI conference on artificial intelligence, AAAI Press, AAAI\u201912, pp 592\u2013598"},{"key":"9301_CR6","doi-asserted-by":"publisher","first-page":"113075","DOI":"10.1016\/j.dss.2019.113075","volume":"123","author":"AF Colladon","year":"2019","unstructured":"Colladon AF, Guardabascio B, Innarella R (2019) Using social network and semantic analysis to analyze online travel forums and forecast tourism demand. Decis Support Syst 123:113075. https:\/\/doi.org\/10.1016\/j.dss.2019.113075","journal-title":"Decis Support Syst"},{"issue":"1","key":"9301_CR7","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/s13278-018-0493-2","volume":"8","author":"K Das","year":"2018","unstructured":"Das K, Samanta S, Pal M (2018) Study on centrality measures in social networks: a survey. Soc Netw Anal Min 8(1):13. https:\/\/doi.org\/10.1007\/s13278-018-0493-2","journal-title":"Soc Netw Anal Min"},{"issue":"20","key":"9301_CR8","doi-asserted-by":"publisher","first-page":"1172","DOI":"10.1016\/j.ipl.2009.07.019","volume":"109","author":"S Dolev","year":"2009","unstructured":"Dolev S, Elovici Y, Puzis R, Zilberman P (2009) Incremental deployment of network monitors based on group betweenness centrality. Inf Process Lett 109(20):1172\u20131176. https:\/\/doi.org\/10.1016\/j.ipl.2009.07.019","journal-title":"Inf Process Lett"},{"issue":"3","key":"9301_CR9","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1080\/0022250X.1999.9990219","volume":"23","author":"MG Everett","year":"1999","unstructured":"Everett MG, Borgatti SP (1999) The centrality of groups and classes. J Math Sociol 23(3):181\u2013201. https:\/\/doi.org\/10.1080\/0022250X.1999.9990219","journal-title":"J Math Sociol"},{"issue":"1","key":"9301_CR10","doi-asserted-by":"publisher","first-page":"35","DOI":"10.2307\/3033543","volume":"40","author":"LC Freeman","year":"1977","unstructured":"Freeman LC (1977) A set of measures of centrality based on betweenness. Sociometry 40(1):35\u201341. https:\/\/doi.org\/10.2307\/3033543","journal-title":"Sociometry"},{"issue":"3","key":"9301_CR11","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\u20131979) Centrality in social networks conceptual clarification. Soc Netw 1(3):215\u2013239. https:\/\/doi.org\/10.1016\/0378-8733(78)90021-7","journal-title":"Soc Netw"},{"key":"9301_CR12","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.socnet.2018.08.001","volume":"56","author":"R Grassi","year":"2019","unstructured":"Grassi R, Calderoni F, Bianchi M, Torriero A (2019) Betweenness to assess leaders in criminal networks: new evidence using the dual projection approach. Soc Netw 56:23\u201332. https:\/\/doi.org\/10.1016\/j.socnet.2018.08.001","journal-title":"Soc Netw"},{"key":"9301_CR13","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.jnca.2016.12.004","volume":"85","author":"J Guan","year":"2017","unstructured":"Guan J, Yan Z, Yao S, Xu C, Zhang H (2017) GBC-based caching function group selection algorithm for SINET. J Netw Comput Appl 85:56\u201363. https:\/\/doi.org\/10.1016\/j.jnca.2016.12.004","journal-title":"J Netw Comput Appl"},{"issue":"2","key":"9301_CR14","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 (2015) Fully dynamic betweenness centrality maintenance on massive networks. Proc VLDB Endow 9(2):48\u201359. https:\/\/doi.org\/10.14778\/2850578.2850580","journal-title":"Proc VLDB Endow"},{"key":"9301_CR16","doi-asserted-by":"publisher","unstructured":"Kchiche A, Kamoun F (2009) Access-points deployment for vehicular networks based on group centrality. In: Proceedings of the 2009 3rd international conference on new technologies, mobility and security pp 1\u20136. https:\/\/doi.org\/10.1109\/NTMS.2009.5384770","DOI":"10.1109\/NTMS.2009.5384770"},{"issue":"3","key":"9301_CR17","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/j.socnet.2009.02.003","volume":"31","author":"ED Kolaczyk","year":"2009","unstructured":"Kolaczyk ED, Chua DB, Barth\u00e9lemy M (2009) Group betweenness and co-betweenness: inter-related notions of coalition centrality. Soc Netw 31(3):190\u2013203. https:\/\/doi.org\/10.1016\/j.socnet.2009.02.003","journal-title":"Soc Netw"},{"key":"9301_CR18","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/j.ins.2015.07.053","volume":"326","author":"MJ Lee","year":"2016","unstructured":"Lee MJ, Choi S, Chung CW (2016) Efficient algorithms for updating betweenness centrality in fully dynamic graphs. Inform Sci 326:278\u2013296. https:\/\/doi.org\/10.1016\/j.ins.2015.07.053","journal-title":"Inform Sci"},{"key":"9301_CR19","unstructured":"Leskovec J, Krevl A (2014) SNAP Datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data, Accessed 27 Feb 2019"},{"key":"9301_CR20","doi-asserted-by":"publisher","unstructured":"Liu B, Cong G, Xu D, Zeng Y (2012) Time constrained influence maximization in social networks. In: Proceedings of the 2012 IEEE 12th international conference on data mining, pp 439\u2013448. https:\/\/doi.org\/10.1109\/ICDM.2012.158","DOI":"10.1109\/ICDM.2012.158"},{"key":"9301_CR21","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1016\/j.future.2017.05.014","volume":"83","author":"M Lujak","year":"2018","unstructured":"Lujak M, Giordani S (2018) Centrality measures for evacuation: finding agile evacuation routes. Future Gener Comput Syst 83:401\u2013412. https:\/\/doi.org\/10.1016\/j.future.2017.05.014","journal-title":"Future Gener Comput Syst"},{"key":"9301_CR15","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.socnet.2004.11.009","volume":"27","author":"JM Newman","year":"2003","unstructured":"Newman JM (2003) A measure of betweenness centrality based on random walks. Soc Netw 27:39\u201354. https:\/\/doi.org\/10.1016\/j.socnet.2004.11.009","journal-title":"Soc Netw"},{"key":"9301_CR22","unstructured":"Ni C, Sugimoto CR, Jian J (2011) Degree, closeness, and betweenness: application of group centrality measurements to explore macro-disciplinary evolution diachronically. In: Proceedings of the 13th international society of scientometrics and informetrics conference (ISSI), pp 1\u201313"},{"key":"9301_CR23","doi-asserted-by":"publisher","first-page":"056709","DOI":"10.1103\/PhysRevE.76.056709","volume":"76","author":"R Puzis","year":"2007","unstructured":"Puzis R, Elovici Y, Dolev S (2007a) Fast algorithm for successive computation of group betweenness centrality. Phys Rev E 76:056709. https:\/\/doi.org\/10.1103\/PhysRevE.76.056709","journal-title":"Phys Rev E"},{"issue":"4","key":"9301_CR24","first-page":"287","volume":"20","author":"R Puzis","year":"2007","unstructured":"Puzis R, Elovici Y, Dolev S (2007b) Finding the most prominent group in complex networks. AI Commun 20(4):287\u2013296","journal-title":"AI Commun"},{"key":"9301_CR25","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/2043635.2043640","volume":"22","author":"R Puzis","year":"2011","unstructured":"Puzis R, Tubi M, Elovici Y, Glezer C, Dolev S (2011) A decision support system for placement of intrusion detection and prevention devices in large-scale networks. ACM Trans Model Comput Simul 22:5. https:\/\/doi.org\/10.1145\/2043635.2043640","journal-title":"ACM Trans Model Comput Simul"},{"issue":"1","key":"9301_CR26","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, Bekhor S, Shiftan Y, Pentland AS (2013) Augmented betweenness centrality for environmentally aware traffic monitoring in transportation networks. J Intell Transp Syst 17(1):91\u2013105. https:\/\/doi.org\/10.1080\/15472450.2012.716663","journal-title":"J Intell Transp Syst"},{"key":"9301_CR27","unstructured":"Rossi RA, Ahmed NK (2015) The network data repository with interactive graph analytics and visualization. In: Proceedings of the twenty-ninth AAAI conference on artificial intelligence. http:\/\/networkrepository.com, Accessed 27 Feb 2019"},{"issue":"1","key":"9301_CR28","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.ejor.2018.05.006","volume":"271","author":"M Rysz","year":"2018","unstructured":"Rysz M, Pajouh FM, Pasiliao EL (2018) Finding clique clusters with the highest betweenness centrality. Eur J Oper Res 271(1):155\u2013164. https:\/\/doi.org\/10.1016\/j.ejor.2018.05.006","journal-title":"Eur J Oper Res"},{"key":"9301_CR29","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.artint.2015.11.001","volume":"231","author":"PL Szczepa\u0144ski","year":"2016","unstructured":"Szczepa\u0144ski PL, Michalak TP, Rahwan T (2016) Efficient algorithms for game-theoretic betweenness centrality. Artif Intell 231:39\u201363. https:\/\/doi.org\/10.1016\/j.artint.2015.11.001","journal-title":"Artif Intell"},{"key":"9301_CR30","doi-asserted-by":"publisher","unstructured":"Tubi M, Puzi R, Elovici Y (2007) Deployment of DNIDS in social networks. In: 2007 IEEE intelligence and security informatics, pp 59\u201365. https:\/\/doi.org\/10.1109\/ISI.2007.379534","DOI":"10.1109\/ISI.2007.379534"},{"issue":"2","key":"9301_CR31","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1080\/10556788.2016.1167892","volume":"32","author":"A Veremyev","year":"2017","unstructured":"Veremyev A, Prokopyev OA, Pasiliao EL (2017) Finding groups with maximum betweenness centrality. Optim Methods Softw 32(2):369\u2013399. https:\/\/doi.org\/10.1080\/10556788.2016.1167892","journal-title":"Optim Methods Softw"},{"key":"9301_CR32","unstructured":"Willoughby R (1970) The University of Florida sparse matrix collection. https:\/\/sparse.tamu.edu, Accessed 27 Feb 2019"}],"container-title":["Computational and Mathematical Organization Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10588-019-09301-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10588-019-09301-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10588-019-09301-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,22]],"date-time":"2020-11-22T00:41:40Z","timestamp":1606005700000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10588-019-09301-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,23]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["9301"],"URL":"https:\/\/doi.org\/10.1007\/s10588-019-09301-9","relation":{},"ISSN":["1381-298X","1572-9346"],"issn-type":[{"value":"1381-298X","type":"print"},{"value":"1572-9346","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,11,23]]},"assertion":[{"value":"23 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}