{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T21:31:09Z","timestamp":1730323869720,"version":"3.28.0"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","funder":[{"name":"National Science Foundation of China","award":["62032001, 62032008"]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,8,9]]},"DOI":"10.1145\/3472456.3472482","type":"proceedings-article","created":{"date-parts":[[2021,10,5]],"date-time":"2021-10-05T18:39:57Z","timestamp":1633459197000},"page":"1-11","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["An Edge-Fencing Strategy for Optimizing SSSP Computations on Large-Scale Graphs"],"prefix":"10.1145","author":[{"given":"Huashan","family":"Yu","sequence":"first","affiliation":[{"name":"Department of Computer Science and Technology, Peking University"}]},{"given":"Xiaolin","family":"Wang","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Technology, Peking University, China"}]},{"given":"Yingwei","family":"Luo","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Technology, Peking University, China"}]}],"member":"320","published-online":{"date-parts":[[2021,10,5]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.286.5439.509"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1038\/35036627"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.90.058701"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/JCN.2006.6182774"},{"key":"e_1_3_2_1_5_1","unstructured":"X. Guardiola R. Guimera A. Arenas A. Diaz-Guilera D. Streib L.A.N. Amaral. Macro- and Micro-structure of Trust Networks. arXiv: cond-mat\/0206240. X. Guardiola R. Guimera A. Arenas A. Diaz-Guilera D. Streib L.A.N. Amaral. Macro- and Micro-structure of Trust Networks. arXiv: cond-mat\/0206240."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/316194.316229"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/70.478429"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.32.1.65"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.2001.9990249"},{"issue":"3","key":"e_1_3_2_1_10_1","first-page":"43","article-title":"Mapping networks of terrorist cells","volume":"24","author":"Krebs Valdis","year":"2002","unstructured":"Valdis Krebs . Mapping networks of terrorist cells . CONNECTIONS , 24 ( 3 ): 43 - 52 , 2002 . Valdis Krebs. Mapping networks of terrorist cells. CONNECTIONS, 24(3):43-52, 2002.","journal-title":"CONNECTIONS"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1038\/35082140"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-019-08746-5"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(69)90028-7"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1090\/qam\/102435"},{"key":"e_1_3_2_1_16_1","volume-title":"October","author":"Meyer U.","year":"2003","unstructured":"U. Meyer and P. Sanders . Delta-stepping: A parallelizable shortest path algorithm. J. Algorithms'03, 49(1):114-152 , October 2003 . U. Meyer and P. Sanders. Delta-stepping: A parallelizable shortest path algorithm. J. Algorithms'03, 49(1):114-152, October 2003."},{"key":"e_1_3_2_1_17_1","first-page":"14","volume-title":"Proceedings of the 2016 International Conference on Super-computing","author":"Lenharth A.","year":"2016","unstructured":"Nguyen, A. Lenharth , M. Garzara\u00b4n , D. Padua , and K. Pingali . Dsmr: A parallel algorithm for single-source shortest path problem . Proceedings of the 2016 International Conference on Super-computing , pages 1\u2013 14 , June 2016 . Nguyen, A. Lenharth, M. Garzara\u00b4n, D. Padua, and K. Pingali. Dsmr: A parallel algorithm for single-source shortest path problem. Proceedings of the 2016 International Conference on Super-computing, pages 1\u201314, June 2016."},{"key":"e_1_3_2_1_18_1","first-page":"454","volume-title":"Yihan Sun. Parallel Shortest Paths Using Radius Stepping. Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures","author":"Blelloch Guy E.","year":"2016","unstructured":"Guy E. Blelloch , Yan Gu , Yihan Sun. Parallel Shortest Paths Using Radius Stepping. Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures , pages 443\u2013 454 , July 2016 Guy E. Blelloch, Yan Gu, Yihan Sun. Parallel Shortest Paths Using Radius Stepping. Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, pages 443\u2013454, July 2016"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/BigData47090.2019.9006237"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1209\/epl\/i2005-10574-3"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2008.72"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/0202004"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.81"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2016.2634535"},{"key":"e_1_3_2_1_25_1","first-page":"1","volume-title":"Direction-optimizing Breadth-First Search. SC '12: Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis","author":"Beamer S.","year":"2012","unstructured":"S. Beamer , K. Asanovic and D. Patterson . Direction-optimizing Breadth-First Search. SC '12: Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis , Salt Lake City, UT , 2012 , pp. 1 - 10 , doi: 10.1109\/SC.2012.50. S. Beamer, K. Asanovic and D. Patterson. Direction-optimizing Breadth-First Search. SC '12: Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis, Salt Lake City, UT, 2012, pp. 1-10, doi: 10.1109\/SC.2012.50."},{"key":"e_1_3_2_1_26_1","volume-title":"Graph evolution: Densification and shrinking diameters. ACM Transactions on Knowledge Discovery from Data (TKDD), 1(1):2","author":"Leskovec J.","year":"2007","unstructured":"J. Leskovec , J. M. Kleinberg , and C. Faloutsos . Graph evolution: Densification and shrinking diameters. ACM Transactions on Knowledge Discovery from Data (TKDD), 1(1):2 , 2007 . J. Leskovec, J. M. Kleinberg, and C. Faloutsos. Graph evolution: Densification and shrinking diameters. ACM Transactions on Knowledge Discovery from Data (TKDD), 1(1):2, 2007."},{"key":"e_1_3_2_1_27_1","unstructured":"Graph 500. http:\/\/www.graph500.org\/. Graph 500. http:\/\/www.graph500.org\/."},{"key":"e_1_3_2_1_28_1","volume-title":"Fibonacci Heaps And Their Uses In Improved Network Optimization Algorithms. Journal of the ACM (JACM), 34(3):596\u2013615","author":"Fredman M. L.","year":"1987","unstructured":"M. L. Fredman and R. E. Tarjan . Fibonacci Heaps And Their Uses In Improved Network Optimization Algorithms. Journal of the ACM (JACM), 34(3):596\u2013615 , 1987 . M. L. Fredman and R. E. Tarjan. Fibonacci Heaps And Their Uses In Improved Network Optimization Algorithms. Journal of the ACM (JACM), 34(3):596\u2013615, 1987."},{"key":"e_1_3_2_1_29_1","unstructured":"MPICH\n : High-Performance Portable MPI. http:\/\/www.mpich.org\/. MPICH: High-Performance Portable MPI. http:\/\/www.mpich.org\/."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972740.43"},{"key":"e_1_3_2_1_31_1","unstructured":"http:\/\/konect.uni-koblenz.de\/ http:\/\/konect.uni-koblenz.de\/"},{"key":"e_1_3_2_1_32_1","unstructured":"http:\/\/webdatacommons.org\/hyperlinkgraph\/2012-08\/download.html http:\/\/webdatacommons.org\/hyperlinkgraph\/2012-08\/download.html"},{"key":"e_1_3_2_1_33_1","unstructured":"http:\/\/networkrepository.com http:\/\/networkrepository.com"},{"key":"e_1_3_2_1_34_1","unstructured":"http:\/\/snap.stanford.edu\/index.html http:\/\/snap.stanford.edu\/index.html"}],"event":{"name":"ICPP 2021: 50th International Conference on Parallel Processing","acronym":"ICPP 2021","location":"Lemont IL USA"},"container-title":["50th International Conference on Parallel Processing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3472456.3472482","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,14]],"date-time":"2023-01-14T19:43:02Z","timestamp":1673725382000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3472456.3472482"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,9]]},"references-count":34,"alternative-id":["10.1145\/3472456.3472482","10.1145\/3472456"],"URL":"https:\/\/doi.org\/10.1145\/3472456.3472482","relation":{},"subject":[],"published":{"date-parts":[[2021,8,9]]},"assertion":[{"value":"2021-10-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}