{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T15:16:22Z","timestamp":1761664582553,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,6,21]],"date-time":"2023-06-21T00:00:00Z","timestamp":1687305600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62032023","T2125013","62172389"],"award-info":[{"award-number":["62032023","T2125013","62172389"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,6,21]]},"DOI":"10.1145\/3577193.3593728","type":"proceedings-article","created":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T18:47:05Z","timestamp":1687286825000},"page":"277-288","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Fast All-Pairs Shortest Paths Algorithm in Large Sparse Graph"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-1083-7894","authenticated-orcid":false,"given":"Shaofeng","family":"Yang","sequence":"first","affiliation":[{"name":"State Key Lab of Processors, Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China"},{"name":"University of Chinese Academy of Sciences, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-5693-014X","authenticated-orcid":false,"given":"Xiandong","family":"Liu","sequence":"additional","affiliation":[{"name":"State Key Lab of Processors, Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China"},{"name":"University of Chinese Academy of Sciences, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-9153-0732","authenticated-orcid":false,"given":"Yunting","family":"Wang","sequence":"additional","affiliation":[{"name":"State Key Lab of Processors, Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0459-2472","authenticated-orcid":false,"given":"Xin","family":"He","sequence":"additional","affiliation":[{"name":"State Key Lab of Processors, Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6361-5948","authenticated-orcid":false,"given":"Guangming","family":"Tan","sequence":"additional","affiliation":[{"name":"State Key Lab of Processors, Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China"}]}],"member":"320","published-online":{"date-parts":[[2023,6,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2005.132"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2014.45"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2049662.2049670"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Edsger W Dijkstra etal 1959. A note on two problems in connexion with graphs. Numerische mathematik 1 1 (1959) 269--271.  Edsger W Dijkstra et al. 1959. A note on two problems in connexion with graphs. Numerische mathematik 1 1 (1959) 269--271.","DOI":"10.1007\/BF01386390"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2015.06.008"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2014.46"},{"volume-title":"Efficient Algorithms for Shortest Paths in Sparse Networks. J. ACM 24","year":"1977","key":"e_1_3_2_1_8_1","unstructured":"Donald, B., and Johnson. 1977. Efficient Algorithms for Shortest Paths in Sparse Networks. J. ACM 24 ( 1977 ). Donald, B., and Johnson. 1977. Efficient Algorithms for Shortest Paths in Sparse Networks. J. ACM 24 (1977)."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/0216064"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1782174.1782200"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC41405.2020.00010"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1997.1404"},{"key":"e_1_3_2_1_13_1","unstructured":"Gary J Katz and Joseph T Kider. 2008. All-pairs shortest-paths for large graphs on the GPU. (2008).  Gary J Katz and Joseph T Kider. 2008. All-pairs shortest-paths for large graphs on the GPU. (2008)."},{"volume-title":"All-Pairs Shortest Path Algorithms Using CUDA. Ph. D. Dissertation","author":"JEREMY KEMP.","key":"e_1_3_2_1_14_1","unstructured":"JEREMY KEMP. 2012. All-Pairs Shortest Path Algorithms Using CUDA. Ph. D. Dissertation . Durham University . JEREMY KEMP. 2012. All-Pairs Shortest Path Algorithms Using CUDA. Ph. D. Dissertation. Durham University."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2013.6494986"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293883.3295716"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-6774(03)00076-2"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1504\/IJHPCN.2012.046384"},{"key":"e_1_3_2_1_19_1","volume-title":"The all-pair shortest-path problem in shared-memory heterogeneous systems. High-Performance Computing on Complex Environments","author":"Ortega-Arranz Hector","year":"2013","unstructured":"Hector Ortega-Arranz , Yuri Torres , Diego R Llanos , and Arturo Gonzalez-Escribano . 2013. The all-pair shortest-path problem in shared-memory heterogeneous systems. High-Performance Computing on Complex Environments ( 2013 ), 283--299. Hector Ortega-Arranz, Yuri Torres, Diego R Llanos, and Arturo Gonzalez-Escribano. 2013. The all-pair shortest-path problem in shared-memory heterogeneous systems. High-Performance Computing on Complex Environments (2013), 283--299."},{"volume-title":"International Conference on High Performance Computing Simulation.","author":"Ortega-Arranz H.","key":"e_1_3_2_1_20_1","unstructured":"H. Ortega-Arranz , Y. Torres , D. R. Llanos , and A. Gonzalez-Escribano . 2013. A new GPU-based approach to the Shortest Path problem . In International Conference on High Performance Computing Simulation. H. Ortega-Arranz, Y. Torres, D. R. Llanos, and A. Gonzalez-Escribano. 2013. A new GPU-based approach to the Shortest Path problem. In International Conference on High Performance Computing Simulation."},{"key":"e_1_3_2_1_21_1","volume-title":"A new variant of the pathfinder algorithm to generate large visual science maps in cubic time. Information processing & management 44, 4","author":"Quirin Arnaud","year":"2008","unstructured":"Arnaud Quirin , Oscar Cord\u00f3n , Jose Santamar\u00eda , Benjamin Vargas-Quesada , and F Moya-Aneg\u00f3n . 2008. A new variant of the pathfinder algorithm to generate large visual science maps in cubic time. Information processing & management 44, 4 ( 2008 ), 1611--1623. Arnaud Quirin, Oscar Cord\u00f3n, Jose Santamar\u00eda, Benjamin Vargas-Quesada, and F Moya-Aneg\u00f3n. 2008. A new variant of the pathfinder algorithm to generate large visual science maps in cubic time. Information processing & management 44, 4 (2008), 1611--1623."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897350.2897355"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3332466.3374533"},{"key":"e_1_3_2_1_24_1","unstructured":"J. G. Siek L. Q. Lee and A. Lumsdaine. 2002. The Boost Graph Library: User Guide and Reference Manual. The Boost Graph Library: User Guide and Reference Manual.  J. G. Siek L. Q. Lee and A. Lumsdaine. 2002. The Boost Graph Library: User Guide and Reference Manual. The Boost Graph Library: User Guide and Reference Manual."},{"key":"e_1_3_2_1_25_1","volume-title":"MPI: The Complete Reference The MIT Press","author":"Snir Marc","year":"1996","unstructured":"Marc Snir , St Otto , St Huss-Lederman , D Walker , and J Dongarra . 1996 . MPI: The Complete Reference The MIT Press . Cambridge , Massachusetts (1996). Marc Snir, St Otto, St Huss-Lederman, D Walker, and J Dongarra. 1996. MPI: The Complete Reference The MIT Press. Cambridge, Massachusetts (1996)."},{"key":"e_1_3_2_1_26_1","volume-title":"Introduction to algorithms","author":"Stein Clifford","year":"2001","unstructured":"Clifford Stein , T Cormen , R Rivest , and C Leiserson . 2001. Introduction to algorithms . The MIT Press 31, 77 ( 2001 ), 13. Clifford Stein, T Cormen, R Rivest, and C Leiserson. 2001. Introduction to algorithms. The MIT Press 31, 77 (2001), 13."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063384.2063431"},{"key":"e_1_3_2_1_28_1","volume-title":"Vin De Silva, and John C Langford","author":"Tenenbaum Joshua B","year":"2000","unstructured":"Joshua B Tenenbaum , Vin De Silva, and John C Langford . 2000 . A global geometric framework for nonlinear dimensionality reduction. science 290, 5500 (2000), 2319--2323. Joshua B Tenenbaum, Vin De Silva, and John C Langford. 2000. A global geometric framework for nonlinear dimensionality reduction. science 290, 5500 (2000), 2319--2323."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2851141.2851145"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3018743.3018755"}],"event":{"name":"ICS '23: 37th International Conference on Supercomputing","sponsor":["SIGARCH ACM Special Interest Group on Computer Architecture"],"location":"Orlando FL USA","acronym":"ICS '23"},"container-title":["Proceedings of the 37th International Conference on Supercomputing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3577193.3593728","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3577193.3593728","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:47:32Z","timestamp":1750178852000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3577193.3593728"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,21]]},"references-count":29,"alternative-id":["10.1145\/3577193.3593728","10.1145\/3577193"],"URL":"https:\/\/doi.org\/10.1145\/3577193.3593728","relation":{},"subject":[],"published":{"date-parts":[[2023,6,21]]},"assertion":[{"value":"2023-06-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}