{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T08:30:57Z","timestamp":1771662657965,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,26]],"date-time":"2019-06-26T00:00:00Z","timestamp":1561507200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["ACI-1265449"],"award-info":[{"award-number":["ACI-1265449"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Louisiana Board of Regents","award":["LEQSF(2015-16)-ENH-TR-10"],"award-info":[{"award-number":["LEQSF(2015-16)-ENH-TR-10"]}]},{"name":"U.S. Naval Research Laboratory Base Program","award":["N00173-16-2-C901"],"award-info":[{"award-number":["N00173-16-2-C901"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,6,26]]},"DOI":"10.1145\/3330345.3330368","type":"proceedings-article","created":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T12:14:30Z","timestamp":1560860070000},"page":"250-260","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["GPU road network graph contraction and SSSP query"],"prefix":"10.1145","author":[{"given":"Roozbeh","family":"Karimi","sequence":"first","affiliation":[{"name":"Louisiana State University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David M.","family":"Koppelman","sequence":"additional","affiliation":[{"name":"Louisiana State University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chris J.","family":"Michael","sequence":"additional","affiliation":[{"name":"Naval Research Laboratory"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,6,26]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Retrieved","year":"2018","unstructured":"2006. 9th DIMACS implementation challenge - shortest paths . Retrieved September 27, 2018 from http:\/\/www.dis.uniroma1.it\/challenge9\/download.shtml 2006. 9th DIMACS implementation challenge - shortest paths. Retrieved September 27, 2018 from http:\/\/www.dis.uniroma1.it\/challenge9\/download.shtml"},{"key":"e_1_3_2_1_2_1","volume-title":"International Colloquium on Automata, Languages, and Programming","author":"Abraham Ittai","unstructured":"Ittai Abraham , Daniel Delling , Amos Fiat , Andrew V Goldberg , and Renato F Werneck . 2011. VC-dimension and shortest path algorithms . In International Colloquium on Automata, Languages, and Programming . Springer , 690--699. Ittai Abraham, Daniel Delling, Amos Fiat, Andrew V Goldberg, and Renato F Werneck. 2011. VC-dimension and shortest path algorithms. In International Colloquium on Automata, Languages, and Programming. Springer, 690--699."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2985473"},{"key":"e_1_3_2_1_4_1","volume-title":"Werneck","author":"Bast Hannah","year":"2016","unstructured":"Hannah Bast , Daniel Delling , Andrew Goldberg , Matthias M\u00fcller-Hannemann , Thomas Pajor , Peter Sanders , Dorothea Wagner , and Renato F . Werneck . 2016 . Route Planning in Transportation Networks. Springer International Publishing , Cham, 19--80. Hannah Bast, Daniel Delling, Andrew Goldberg, Matthias M\u00fcller-Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner, and Renato F. Werneck. 2016. Route Planning in Transportation Networks. Springer International Publishing, Cham, 19--80."},{"key":"e_1_3_2_1_5_1","volume-title":"Werneck","author":"Bast Hannah","year":"2015","unstructured":"Hannah Bast , Daniel Delling , Andrew V. Goldberg , Matthias M\u00fcller-Hannemann , Thomas Pajor , Peter Sanders , Dorothea Wagner , and Renato F . Werneck . 2015 . Route Planning in Transportation Networks. CoRR abs\/1504.05140 (2015). arXiv:1504.05140 http:\/\/arxiv.org\/abs\/1504.05140 Hannah Bast, Daniel Delling, Andrew V. Goldberg, Matthias M\u00fcller-Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner, and Renato F. Werneck. 2015. Route Planning in Transportation Networks. CoRR abs\/1504.05140 (2015). arXiv:1504.05140 http:\/\/arxiv.org\/abs\/1504.05140"},{"key":"e_1_3_2_1_7_1","volume-title":"On a routing problem. Quarterly of applied mathematics 16, 1","author":"Bellman Richard","year":"1958","unstructured":"Richard Bellman . 1958. On a routing problem. Quarterly of applied mathematics 16, 1 ( 1958 ), 87--90. Richard Bellman. 1958. On a routing problem. Quarterly of applied mathematics 16, 1 (1958), 87--90."},{"key":"e_1_3_2_1_8_1","volume-title":"Work-Efficient Parallel GPU Methods for Single-Source Shortest Paths. In Parallel and Distributed Processing Symposium","author":"Davidson A.","year":"2014","unstructured":"A. Davidson , S. Baxter , M. Garland , and J.D. Owens . 2014 . Work-Efficient Parallel GPU Methods for Single-Source Shortest Paths. In Parallel and Distributed Processing Symposium , 2014 IEEE 28th International. 349--359. A. Davidson, S. Baxter, M. Garland, and J.D. Owens. 2014. Work-Efficient Parallel GPU Methods for Single-Source Shortest Paths. In Parallel and Distributed Processing Symposium, 2014 IEEE 28th International. 349--359."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2011.89"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2886843"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1463434.1463455"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3139958.3139999"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/1788888.1788912"},{"key":"e_1_3_2_1_16_1","volume-title":"Wen-mei W. Hwu (Ed.)","volume":"2","author":"Jia Y.","unstructured":"Y. Jia , V. Lu , J. Hoberock , M. Garland , and J.C. Hart . 2011. Edge v. Node Parallelism for Graph Centrality Metrics. In GPU Computing Gems Jade Edition (1st ed.) , Wen-mei W. Hwu (Ed.) , Vol. 2 . Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 15--30. Y. Jia, V. Lu, J. Hoberock, M. Garland, and J.C. Hart. 2011. Edge v. Node Parallelism for Graph Centrality Metrics. In GPU Computing Gems Jade Edition (1st ed.), Wen-mei W. Hwu (Ed.), Vol. 2. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 15--30."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1413957.1413966"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2600212.2600227"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-41321-1_4"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/22145.22146"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2851141.2851183"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-6774(03)00076-2"},{"key":"e_1_3_2_1_23_1","volume-title":"nvGRAPH library user's guide","author":"NVIDIA Corporation","unstructured":"NVIDIA Corporation . 2018. nvGRAPH library user's guide . NVIDIA Corporation . NVIDIA Corporation. 2018. nvGRAPH library user's guide. NVIDIA Corporation."},{"key":"e_1_3_2_1_24_1","volume-title":"NVIDIA CUDA C Programming Guide V 9.2 (v 9.2 ed.)","author":"NVIDIA Corporation","unstructured":"NVIDIA Corporation . 2018. NVIDIA CUDA C Programming Guide V 9.2 (v 9.2 ed.) . NVIDIA Corporation . NVIDIA Corporation. 2018. NVIDIA CUDA C Programming Guide V 9.2 (v 9.2 ed.). NVIDIA Corporation."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2983990.2984015"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2530531"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2851141.2851145"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3108140"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487665"}],"event":{"name":"ICS '19: 2019 International Conference on Supercomputing","location":"Phoenix Arizona","acronym":"ICS '19","sponsor":["SIGARCH ACM Special Interest Group on Computer Architecture"]},"container-title":["Proceedings of the ACM International Conference on Supercomputing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3330345.3330368","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3330345.3330368","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3330345.3330368","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:54:05Z","timestamp":1750204445000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3330345.3330368"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,26]]},"references-count":27,"alternative-id":["10.1145\/3330345.3330368","10.1145\/3330345"],"URL":"https:\/\/doi.org\/10.1145\/3330345.3330368","relation":{},"subject":[],"published":{"date-parts":[[2019,6,26]]},"assertion":[{"value":"2019-06-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}