{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,25]],"date-time":"2026-07-25T03:59:57Z","timestamp":1784951997333,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,2,23]],"date-time":"2013-02-23T00:00:00Z","timestamp":1361577600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,2,23]]},"DOI":"10.1145\/2442516.2442521","type":"proceedings-article","created":{"date-parts":[[2013,2,26]],"date-time":"2013-02-26T10:23:04Z","timestamp":1361874184000},"page":"35-46","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":30,"title":["Betweenness centrality"],"prefix":"10.1145","author":[{"given":"Dimitrios","family":"Prountzos","sequence":"first","affiliation":[{"name":"The University of Texas at Austin, Austin, TX, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Keshav","family":"Pingali","sequence":"additional","affiliation":[{"name":"The University of Texas at Austin, Austin, TX, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2013,2,23]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Galois system. http:\/\/iss.ices.utexas.edu\/?p=projects\/galois.  Galois system. http:\/\/iss.ices.utexas.edu\/?p=projects\/galois."},{"key":"e_1_3_2_1_2_1","volume-title":"http:\/\/www.dis.uniroma1.it\/~challenge9\/download.shtml","author":"Implementation Challenge DIMACS","year":"2009","unstructured":"9th DIMACS Implementation Challenge . http:\/\/www.dis.uniroma1.it\/~challenge9\/download.shtml , 2009 . 9th DIMACS Implementation Challenge. http:\/\/www.dis.uniroma1.it\/~challenge9\/download.shtml, 2009."},{"key":"e_1_3_2_1_3_1","volume-title":"Hpcs scalable synthetic compact applications graph analysis (SSCA2) benchmark v2.2","author":"Bader D.","year":"2007","unstructured":"D. Bader ., J. Gilbert , J. Kepner , and K. Madduri . Hpcs scalable synthetic compact applications graph analysis (SSCA2) benchmark v2.2 , 2007 . http:\/\/www.graphanalysis.org\/benchmark\/. D. Bader., J. Gilbert, J. Kepner, and K. Madduri. Hpcs scalable synthetic compact applications graph analysis (SSCA2) benchmark v2.2, 2007. http:\/\/www.graphanalysis.org\/benchmark\/."},{"key":"e_1_3_2_1_4_1","volume-title":"WAW","author":"Bader D. A.","year":"2007","unstructured":"D. A. Bader , S. Kintali , K. Madduri , and M. Mihail . Approximating betweenness centrality . In WAW , Berlin , Heidelberg , 2007 . D. A. Bader, S. Kintali, K. Madduri, and M. Mihail. Approximating betweenness centrality. In WAW, Berlin, Heidelberg, 2007."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2006.57"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989493.1989553"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/209936.209958"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/324133.324234"},{"key":"e_1_3_2_1_9_1","first-page":"25","author":"Brandes U.","year":"2001","unstructured":"U. Brandes . A faster algorithm for betweenness centrality. Journal of Mathematical Sociology , 25 , 2001 . U. Brandes. A faster algorithm for betweenness centrality. Journal of Mathematical Sociology, 25, 2001.","journal-title":"Journal of Mathematical Sociology"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"U. Brandes and C. Pich. Centrality Estimation in Large Networks. International Journal of Birfucation and Chaos 2007 17 7","DOI":"10.1142\/S0218127407018403"},{"key":"e_1_3_2_1_11_1","volume-title":"Does e-mail make white collar workers more productive? Technical report","author":"Bulkley N.","year":"2004","unstructured":"N. Bulkley and M. V. Alstyne . Does e-mail make white collar workers more productive? Technical report , University of Michigan , 2004 . N. Bulkley and M. V. Alstyne. Does e-mail make white collar workers more productive? Technical report, University of Michigan, 2004."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1177\/1094342011403516"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972740.43"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2010.5470354"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/971617.971643"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2011.393"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bti167"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2010.66"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/HIPC.2010.5713180"},{"key":"e_1_3_2_1_20_1","volume-title":"A set of measures of centrality based on betweenness","author":"Freeman L. C.","year":"1977","unstructured":"L. C. Freeman . A set of measures of centrality based on betweenness . 1977 . L. C. Freeman. A set of measures of centrality based on betweenness. 1977."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/2791204.2791213"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.122653799"},{"key":"e_1_3_2_1_23_1","volume-title":"A. Turtschi, and L. A. N. Amaral. The worldwide air transportation network: Anomalous centrality, community structure, and cities' global roles. NAS, 102(22)","author":"Guimer R.","year":"2005","unstructured":"R. Guimer ` a, S. Mossa , A. Turtschi, and L. A. N. Amaral. The worldwide air transportation network: Anomalous centrality, community structure, and cities' global roles. NAS, 102(22) , 2005 . R. Guimer`a, S. Mossa, A. Turtschi, and L. A. N. Amaral. The worldwide air transportation network: Anomalous centrality, community structure, and cities' global roles. NAS, 102(22), 2005."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1941553.1941557"},{"key":"e_1_3_2_1_25_1","volume-title":"Nature","author":"Jeong H.","year":"2001","unstructured":"H. Jeong , S. P. Mason , A. L. Barabasi , and Z. N. Oltvai . Lethality and centrality in protein networks . Nature , 411, May 2001 . H. Jeong, S. P. Mason, A. L. Barabasi, and Z. N. Oltvai. Lethality and centrality in protein networks. Nature, 411, May 2001."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2010.5470400"},{"key":"e_1_3_2_1_27_1","volume-title":"Connections","author":"Krebs V.","year":"2002","unstructured":"V. Krebs . Mapping networks of terrorist cells . Connections , 2002 . V. Krebs. Mapping networks of terrorist cells. Connections, 2002."},{"key":"e_1_3_2_1_28_1","volume-title":"The web of human sexual contacts. Nature, 411","author":"Liljeros F.","year":"2001","unstructured":"F. Liljeros , C. Edling , L. Amaral , H. Stanley , and Y. Aberg . The web of human sexual contacts. Nature, 411 , 2001 . F. Liljeros, C. Edling, L. Amaral, H. Stanley, and Y. Aberg. The web of human sexual contacts. Nature, 411, 2001."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2009.5161100"},{"key":"e_1_3_2_1_30_1","volume-title":"ESA","author":"Meyer U.","year":"1998","unstructured":"U. Meyer and P. Sanders . Delta-stepping: A parallel single source shortest path algorithm . In ESA , 1998 . U. Meyer and P. Sanders. Delta-stepping: A parallel single source shortest path algorithm. In ESA, 1998."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1950365.1950404"},{"key":"e_1_3_2_1_32_1","first-page":"10","author":"Palla G.","year":"2008","unstructured":"G. Palla , I. J. Farkas , P. Pollner , I. Derenyi , and T. Vicsek . Fundamental statistical features and self-similar properties of tagged networks. New Journal of Physics , 10 , 2008 . http:\/\/cfinder.org\/wiki\/?n=Main.Data#toc2. G. Palla, I. J. Farkas, P. Pollner, I. Derenyi, and T. Vicsek. Fundamental statistical features and self-similar properties of tagged networks. New Journal of Physics, 10, 2008. http:\/\/cfinder.org\/wiki\/?n=Main.Data#toc2.","journal-title":"New Journal of Physics"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2010.34"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993498.1993501"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-12-149"},{"key":"e_1_3_2_1_37_1","volume-title":"The Boost Graph Library: User Guide and Reference Manual (C++ In-Depth Series)","author":"Siek J. G.","year":"2001","unstructured":"J. G. Siek . and a. A. L. L.Q. Lee . The Boost Graph Library: User Guide and Reference Manual (C++ In-Depth Series) . Addison-Wesley Professional , 2001 . J. G. Siek. and a. A. L. L.Q. Lee. The Boost Graph Library: User Guide and Reference Manual (C++ In-Depth Series). Addison-Wesley Professional, 2001."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-009-0339-9"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2009.53"},{"key":"e_1_3_2_1_40_1","volume-title":"Fast computing betweenness centrality with virtual nodes on large sparse networks. PLoS ONE, 6(7)","author":"Yang J.","year":"2011","unstructured":"J. Yang and Y. Chen . Fast computing betweenness centrality with virtual nodes on large sparse networks. PLoS ONE, 6(7) , 2011 . J. Yang and Y. Chen. Fast computing betweenness centrality with virtual nodes on large sparse networks. PLoS ONE, 6(7), 2011."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSBW.2005.13"}],"event":{"name":"PPoPP '13: ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","location":"Shenzhen China","acronym":"PPoPP '13","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 18th ACM SIGPLAN symposium on Principles and practice of parallel programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2442516.2442521","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2442516.2442521","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:19:06Z","timestamp":1750220346000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2442516.2442521"}},"subtitle":["algorithms and implementations"],"short-title":[],"issued":{"date-parts":[[2013,2,23]]},"references-count":40,"alternative-id":["10.1145\/2442516.2442521","10.1145\/2442516"],"URL":"https:\/\/doi.org\/10.1145\/2442516.2442521","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2517327.2442521","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2013,2,23]]},"assertion":[{"value":"2013-02-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}