{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T03:50:16Z","timestamp":1782964216130,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":45,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,11,12]],"date-time":"2017-11-12T00:00:00Z","timestamp":1510444800000},"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":[[2017,11,12]]},"DOI":"10.1145\/3126908.3126971","type":"proceedings-article","created":{"date-parts":[[2017,11,8]],"date-time":"2017-11-08T21:02:30Z","timestamp":1510174950000},"page":"1-14","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":47,"title":["Scaling betweenness centrality using communication-efficient sparse matrix multiplication"],"prefix":"10.1145","author":[{"given":"Edgar","family":"Solomonik","sequence":"first","affiliation":[{"name":"University of Illinois at Urbana-Champaign"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Maciej","family":"Besta","sequence":"additional","affiliation":[{"name":"ETH Zurich"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Flavio","family":"Vella","sequence":"additional","affiliation":[{"name":"Sapienza University of Rome"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Torsten","family":"Hoefler","sequence":"additional","affiliation":[{"name":"ETH Zurich"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,11,12]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.395.0575"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(90)90188-N"},{"key":"e_1_3_2_1_3_1","volume-title":"Exploiting multiple levels of parallelism in sparse matrix-matrix multiplication. arXiv preprint arXiv:1510.00844","author":"Azad Ariful","year":"2015","unstructured":"Ariful Azad , Grey Ballard , Aydin Buluc , James Demmel , Laura Grigori , Oded Schwartz , Sivan Toledo , and Samuel Williams . 2015. Exploiting multiple levels of parallelism in sparse matrix-matrix multiplication. arXiv preprint arXiv:1510.00844 ( 2015 ). Ariful Azad, Grey Ballard, Aydin Buluc, James Demmel, Laura Grigori, Oded Schwartz, Sivan Toledo, and Samuel Williams. 2015. Exploiting multiple levels of parallelism in sparse matrix-matrix multiplication. arXiv preprint arXiv:1510.00844 (2015)."},{"key":"e_1_3_2_1_4_1","volume-title":"Algorithms and Models for the Web-Graph","author":"Bader David A","unstructured":"David A Bader , Shiva Kintali , Kamesh Madduri , and Milena Mihail . 2007. Approximating betweenness centrality . In Algorithms and Models for the Web-Graph . Springer , 124--137. David A Bader, Shiva Kintali, Kamesh Madduri, and Milena Mihail. 2007. Approximating betweenness centrality. In Algorithms and Models for the Web-Graph. Springer, 124--137."},{"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\/2486159.2486196"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2903150.2903153"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8191(89)90091-4"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.2001.9990249"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1177\/1094342011403516"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/110848244"},{"key":"e_1_3_2_1_14_1","volume-title":"SDM","author":"Chakrabarti Deepayan","unstructured":"Deepayan Chakrabarti , Yiping Zhan , and Christos Faloutsos . 2004. R-MAT: A Recursive Model for Graph Mining .. In SDM , Vol. 4 . SIAM , 442--446. Deepayan Chakrabarti, Yiping Zhan, and Christos Faloutsos. 2004. R-MAT: A Recursive Model for Graph Mining.. In SDM, Vol. 4. SIAM, 442--446."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2012.46"},{"key":"e_1_3_2_1_16_1","volume-title":"Leiserson","author":"Cormen Thomas H.","year":"2001","unstructured":"Thomas H. Cormen , Clifford Stein , Ronald L. Rivest , and Charles E . Leiserson . 2001 . Introduction to Algorithms (2nd ed.). McGraw-Hill Higher Education . Thomas H. Cormen, Clifford Stein, Ronald L. Rivest, and Charles E. Leiserson. 2001. Introduction to Algorithms (2nd ed.). McGraw-Hill Higher Education."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/0210049"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1687399.1687501"},{"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":"AGPU-Based Solution to Fast Calculation of Betweenness Centrality on Large Weighted Networks. arXiv preprint arXiv:1701.05975","author":"Fan Rui","year":"2017","unstructured":"Rui Fan , Ke Xu , and Jichang Zhao . 2017. AGPU-Based Solution to Fast Calculation of Betweenness Centrality on Large Weighted Networks. arXiv preprint arXiv:1701.05975 ( 2017 ). Rui Fan, Ke Xu, and Jichang Zhao. 2017. AGPU-Based Solution to Fast Calculation of Betweenness Centrality on Large Weighted Networks. arXiv preprint arXiv:1701.05975 (2017)."},{"key":"e_1_3_2_1_21_1","unstructured":"Lester Randolph Ford. 1956. Network Flow Theory. (1956).  Lester Randolph Ford. 1956. Network Flow Theory. (1956)."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177706098"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2013.05.203"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2010.5470400"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8191(93)90029-K"},{"key":"e_1_3_2_1_26_1","volume-title":"Graph algorithms in the language of linear algebra","author":"Kepner Jeremy","unstructured":"Jeremy Kepner and John Gilbert . 2011. Graph algorithms in the language of linear algebra . Vol. 22 . SIAM. Jeremy Kepner and John Gilbert. 2011. Graph algorithms in the language of linear algebra. Vol. 22. SIAM."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2008.19"},{"key":"e_1_3_2_1_28_1","volume-title":"Algorithms and Lower Bounds. ArXiv e-prints (Sept","author":"Kintali S.","year":"2008","unstructured":"S. Kintali . 2008. Betweenness Centrality : Algorithms and Lower Bounds. ArXiv e-prints (Sept . 2008 ). arXiv:cs.DS\/0809.1906 S. Kintali. 2008. Betweenness Centrality : Algorithms and Lower Bounds. ArXiv e-prints (Sept. 2008). arXiv:cs.DS\/0809.1906"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250734.1250759"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/355841.355847"},{"key":"e_1_3_2_1_31_1","unstructured":"Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data. (June 2014).  Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data. (June 2014)."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626407002843"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2009.5161100"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00008264"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2014.52"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517327.2442521"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2458523.2458531"},{"key":"e_1_3_2_1_38_1","volume-title":"Fast network centrality analysis using GPUs. BMC bioinformatics 12, 1","author":"Shi Zhiao","year":"2011","unstructured":"Zhiao Shi and Bing Zhang . 2011. Fast network centrality analysis using GPUs. BMC bioinformatics 12, 1 ( 2011 ), 1. Zhiao Shi and Bing Zhang. 2011. Fast network centrality analysis using GPUs. BMC bioinformatics 12, 1 (2011), 1."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2612669.2612671"},{"key":"e_1_3_2_1_40_1","series-title":"Lecture Notes in Computer Science","volume-title":"Euro-Par 2011 Parallel Processing, Emmanuel Jeannot, Raymond Namyst, and Jean Roman (Eds.)","author":"Solomonik Edgar","unstructured":"Edgar Solomonik and James Demmel . 2011. Communication-Optimal Parallel 2.5D Matrix Multiplication and LU Factorization Algorithms . In Euro-Par 2011 Parallel Processing, Emmanuel Jeannot, Raymond Namyst, and Jean Roman (Eds.) . Lecture Notes in Computer Science , Vol. 6853 . Springer Berlin Heidelberg , 90--109. Edgar Solomonik and James Demmel. 2011. Communication-Optimal Parallel 2.5D Matrix Multiplication and LU Factorization Algorithms. In Euro-Par 2011 Parallel Processing, Emmanuel Jeannot, Raymond Namyst, and Jean Roman (Eds.). Lecture Notes in Computer Science, Vol. 6853. Springer Berlin Heidelberg, 90--109."},{"key":"e_1_3_2_1_41_1","volume-title":"Sparse Tensor Algebra as a Parallel Programming Model. ArXiv e-prints (Nov","author":"Solomonik Edgar","year":"2015","unstructured":"Edgar Solomonik and Torsten Hoefler . 2015. Sparse Tensor Algebra as a Parallel Programming Model. ArXiv e-prints (Nov . 2015 ). arXiv:cs.MS\/1512.00066 Edgar Solomonik and Torsten Hoefler. 2015. Sparse Tensor Algebra as a Parallel Programming Model. ArXiv e-prints (Nov. 2015). arXiv:cs.MS\/1512.00066"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-009-0339-9"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2009.53"},{"key":"e_1_3_2_1_44_1","series-title":"Lecture Notes in Computer Science","volume-title":"All-Pairs Shortest Paths Computation inthe BSPModel","author":"Tiskin Alexander","unstructured":"Alexander Tiskin . 2001. All-Pairs Shortest Paths Computation inthe BSPModel . In Automata, Languages and Programming, Fernando Orejas, Paul Spirakis, and Jan van Leeuwen (Eds.). Lecture Notes in Computer Science , Vol. 2076 . Springer Berlin \/ Heidelberg , 178--189. Alexander Tiskin. 2001. All-Pairs Shortest Paths Computation inthe BSPModel. In Automata, Languages and Programming, Fernando Orejas, Paul Spirakis, and Jan van Leeuwen (Eds.). Lecture Notes in Computer Science, Vol. 2076. Springer Berlin \/ Heidelberg, 178--189."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1096-9128(199704)9:4<255::AID-CPE250>3.0.CO;2-2"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0022557"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSBW.2005.13"}],"event":{"name":"SC '17: The International Conference for High Performance Computing, Networking, Storage and Analysis","location":"Denver Colorado","acronym":"SC '17","sponsor":["SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing","IEEE CS"]},"container-title":["Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3126908.3126971","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3126908.3126971","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:11:06Z","timestamp":1750212666000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3126908.3126971"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,12]]},"references-count":45,"alternative-id":["10.1145\/3126908.3126971","10.1145\/3126908"],"URL":"https:\/\/doi.org\/10.1145\/3126908.3126971","relation":{},"subject":[],"published":{"date-parts":[[2017,11,12]]},"assertion":[{"value":"2017-11-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}