{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T05:06:05Z","timestamp":1778562365027,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,4,10]],"date-time":"2011-04-10T00:00:00Z","timestamp":1302393600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000144","name":"Division of Computer and Network Systems","doi-asserted-by":"publisher","award":["CNS-0831785CNS-0952420"],"award-info":[{"award-number":["CNS-0831785CNS-0952420"]}],"id":[{"id":"10.13039\/100000144","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,4,10]]},"DOI":"10.1145\/1989656.1989657","type":"proceedings-article","created":{"date-parts":[[2011,6,6]],"date-time":"2011-06-06T11:53:52Z","timestamp":1307361232000},"page":"1-6","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":44,"title":["K-path centrality"],"prefix":"10.1145","author":[{"given":"Tharaka","family":"Alahakoon","sequence":"first","affiliation":[{"name":"University of South Florida, Tampa, FL"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rahul","family":"Tripathi","sequence":"additional","affiliation":[{"name":"University of South Florida, Tampa, FL"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Kourtellis","sequence":"additional","affiliation":[{"name":"University of South Florida, Tampa, FL"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ramanuja","family":"Simha","sequence":"additional","affiliation":[{"name":"University of South Florida, Tampa, FL"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adriana","family":"Iamnitchi","sequence":"additional","affiliation":[{"name":"University of South Florida, Tampa, FL"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,4,10]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"T. Alahakoon R. Tripathi N. Kourtellis R. Simha and A. Iamnitchi. K-path centrality: A new centrality measure in social networks. http:\/\/www.csee.usf.edu\/~tripathi\/kpath-centrality.pdf.  T. Alahakoon R. Tripathi N. Kourtellis R. Simha and A. Iamnitchi. K-path centrality: A new centrality measure in social networks. http:\/\/www.csee.usf.edu\/~tripathi\/kpath-centrality.pdf."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1777879.1777889"},{"key":"e_1_3_2_1_4_1","unstructured":"V. Batagelj and A. Mrvar. Pajek datasets. http:\/\/vlado.fmf.unilj.si\/pub\/networks\/data\/ 2006.  V. Batagelj and A. Mrvar. Pajek datasets. http:\/\/vlado.fmf.unilj.si\/pub\/networks\/data\/ 2006."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.2001.9990249"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218127407018403"},{"issue":"1","key":"e_1_3_2_1_7_1","first-page":"39","article-title":"Fast approximation of centrality. J. of Graph Algorithms &","volume":"8","author":"Eppstein D.","year":"2004","unstructured":"D. Eppstein and J. Wang . Fast approximation of centrality. J. of Graph Algorithms & Applications , 8 ( 1 ): 39 -- 45 , 2004 . D. Eppstein and J. Wang. Fast approximation of centrality. J. of Graph Algorithms & Applications, 8(1):39--45, 2004.","journal-title":"Applications"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(91)90017-N"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.2307\/3033543"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1093\/sf\/62.1.54"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2010.170"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/978-3-540-31955-9_4","volume-title":"Network Analysis","author":"Jacob R.","year":"2005","unstructured":"R. Jacob , D. Kosch\u00fctzki , K. Lehmann , L. Peeters , and D. Podehl . Algorithms for centrality indices . In Network Analysis , pages 62 -- 82 . Springer-Verlag LNCS #3418, 2005 . R. Jacob, D. Kosch\u00fctzki, K. Lehmann, L. Peeters, and D. Podehl. Algorithms for centrality indices. In Network Analysis, pages 62--82. Springer-Verlag LNCS #3418, 2005."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1038\/35075138"},{"key":"e_1_3_2_1_14_1","first-page":"01710","article-title":"Betweenness centrality correlation in social networks","volume":"67","author":"Kahng G.","year":"2003","unstructured":"G. Kahng , E. Oh , B. Kahng , and D. Kim . Betweenness centrality correlation in social networks . Phys. Rev. E , 67 : 01710 -- 01711 , 2003 . G. Kahng, E. Oh, B. Kahng, and D. Kim. Betweenness centrality correlation in social networks. Phys. Rev. E, 67:01710--1, 2003.","journal-title":"Phys. Rev. E"},{"key":"e_1_3_2_1_15_1","volume-title":"http:\/\/snap.stanford.edu\/data\/","author":"Leskovec J.","year":"2009","unstructured":"J. Leskovec . Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data\/ , 2009 . J. Leskovec. Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data\/, 2009."},{"key":"e_1_3_2_1_16_1","first-page":"165","volume-title":"VLDB","author":"Lipton R.","year":"1989","unstructured":"R. Lipton and J. Naughton . Estimating the size of generalized transitive closures . In VLDB , pages 165 -- 171 , 1989 . R. Lipton and J. Naughton. Estimating the size of generalized transitive closures. In VLDB, pages 165--171, 1989."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2004.11.009"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2004.01.010"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.csda.2007.07.021"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772778"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.71.055103"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(89)90016-6"}],"event":{"name":"EuroSys '11: Sixth EuroSys Conference 2011","location":"Salzburg Austria","acronym":"EuroSys '11","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems"]},"container-title":["Proceedings of the 4th Workshop on Social Network Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1989656.1989657","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1989656.1989657","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:05:54Z","timestamp":1750244754000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1989656.1989657"}},"subtitle":["a new centrality measure in social networks"],"short-title":[],"issued":{"date-parts":[[2011,4,10]]},"references-count":21,"alternative-id":["10.1145\/1989656.1989657","10.1145\/1989656"],"URL":"https:\/\/doi.org\/10.1145\/1989656.1989657","relation":{},"subject":[],"published":{"date-parts":[[2011,4,10]]},"assertion":[{"value":"2011-04-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}