{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T04:16:49Z","timestamp":1777954609348,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":68,"publisher":"ACM","funder":[{"DOI":"10.13039\/501100006374","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-2103483, CCF-2238358, CCF-2339310, IIS-2227669, TI-2346223"],"award-info":[{"award-number":["CCF-2103483, CCF-2238358, CCF-2339310, IIS-2227669, TI-2346223"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"name":"UCR Regents Faculty Fellowship"},{"name":"UCR Regents Faculty Development Award"},{"name":"Google Research Scholar Program"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,7,16]]},"DOI":"10.1145\/3694906.3743311","type":"proceedings-article","created":{"date-parts":[[2025,7,16]],"date-time":"2025-07-16T16:19:56Z","timestamp":1752682796000},"page":"458-472","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Parallel Point-to-Point Shortest Paths and Batch Queries"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4828-7066","authenticated-orcid":false,"given":"Xiaojun","family":"Dong","sequence":"first","affiliation":[{"name":"UC Riverside, Riverside, CA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-7934-2201","authenticated-orcid":false,"given":"Andy","family":"Li","sequence":"additional","affiliation":[{"name":"UC Riverside, Riverside, CA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4392-4022","authenticated-orcid":false,"given":"Yan","family":"Gu","sequence":"additional","affiliation":[{"name":"UC Riverside, Riverside, CA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3212-0934","authenticated-orcid":false,"given":"Yihan","family":"Sun","sequence":"additional","affiliation":[{"name":"UC Riverside, Riverside, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2025,7,16]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"2024. GraphHopper. https:\/\/www.graphhopper.com\/."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465315"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150412"},{"key":"e_1_3_2_1_4_1","volume-title":"Proceedings of the International Symposium on Combinatorial Search","volume":"9","author":"Barley Michael","year":"2018","unstructured":"Michael Barley, Patricia Riddle, Carlos Linares L\u00f3pez, Sean Dobson, and Ira Pohl. 2018. GBFHS: A generalized breadth-first heuristic search algorithm. In Proceedings of the International Symposium on Combinatorial Search, Vol. 9. 28--36."},{"key":"e_1_3_2_1_5_1","volume-title":"Thomas Pajor, Peter Sanders, Dorothea Wagner, and Renato F 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. Algorithm engineering: Selected results and surveys (2016), 19--80."},{"key":"e_1_3_2_1_6_1","volume-title":"Fast routing in road networks with transit nodes. Science 316, 5824","author":"Bast Holger","year":"2007","unstructured":"Holger Bast, Stefan Funke, Peter Sanders, and Dominik Schultes. 2007. Fast routing in road networks with transit nodes. Science 316, 5824 (2007), 566--566."},{"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."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3350755.3400254"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3350755.3400227"},{"key":"e_1_3_2_1_10_1","volume-title":"Parallel Shortest Paths Using Radius Stepping. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 443--454","author":"Blelloch Guy E.","year":"2016","unstructured":"Guy E. Blelloch, Yan Gu, Yihan Sun, and Kanat Tangwongsan. 2016. Parallel Shortest Paths Using Radius Stepping. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 443--454."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988752"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1998.1425"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384270"},{"key":"e_1_3_2_1_14_1","volume-title":"Introduction to Algorithms","author":"Cormen Thomas H.","unstructured":"Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. 2009. Introduction to Algorithms (3rd edition). MIT Press.","edition":"3"},{"key":"e_1_3_2_1_15_1","volume-title":"Linear programming and extensions","author":"Dantzig George","unstructured":"George Dantzig. 1963. Linear programming and extensions. Princeton university press."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.14778\/3436905.3436923"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2886843"},{"key":"e_1_3_2_1_18_1","volume-title":"A note on two problems in connexion with graphs. Numerische mathematik 1, 1","author":"Dijkstra Edsger W.","year":"1959","unstructured":"Edsger W. Dijkstra. 1959. A note on two problems in connexion with graphs. Numerische mathematik 1, 1 (1959)."},{"key":"e_1_3_2_1_19_1","volume-title":"Efficient Stepping Algorithms and Implementations for Parallel Shortest Paths. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 184--197","author":"Dong Xiaojun","year":"2021","unstructured":"Xiaojun Dong, Yan Gu, Yihan Sun, and Yunming Zhang. 2021. Efficient Stepping Algorithms and Implementations for Parallel Shortest Paths. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 184--197."},{"key":"e_1_3_2_1_20_1","volume-title":"Orionet: Parallel Point-to-Point Shortest Paths and Batch Queries. https:\/\/github.com\/ucrparlay\/Orionet.","author":"Dong Xiaojun","year":"2025","unstructured":"Xiaojun Dong, Andy Li, Yan Gu, and Yihan Sun. 2025. Orionet: Parallel Point-to-Point Shortest Paths and Batch Queries. https:\/\/github.com\/ucrparlay\/Orionet."},{"key":"e_1_3_2_1_21_1","volume-title":"Parallel Point-to-Point Shortest Paths and Batch Queries. arXiv preprint:2506.16488","author":"Dong Xiaojun","year":"2025","unstructured":"Xiaojun Dong, Andy Li, Yan Gu, and Yihan Sun. 2025. Parallel Point-to-Point Shortest Paths and Batch Queries. arXiv preprint:2506.16488 (2025)."},{"key":"e_1_3_2_1_22_1","volume-title":"Provably Fast and Space-Efficient Parallel Biconnectivity. In ACM Symposium on Principles and Practice of Parallel Programming (PPOPP). 52--65","author":"Dong Xiaojun","year":"2023","unstructured":"Xiaojun Dong, Letong Wang, Yan Gu, and Yihan Sun. 2023. Provably Fast and Space-Efficient Parallel Biconnectivity. In ACM Symposium on Principles and Practice of Parallel Programming (PPOPP). 52--65."},{"key":"e_1_3_2_1_23_1","unstructured":"Dheeru Dua and Casey Graf. 2017. UCI Machine Learning Repository. http:\/\/archive.ics.uci.edu\/ml\/."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/18M1166791"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.snb.2015.03.028"},{"key":"e_1_3_2_1_26_1","unstructured":"Lester R Ford Jr. 1956. Network flow theory. Technical Report. Rand Corp Santa Monica Ca."},{"key":"e_1_3_2_1_27_1","volume-title":"10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10)","author":"Geisberger Robert","year":"2010","unstructured":"Robert Geisberger and Peter Sanders. 2010. Engineering time-dependent many-to-many shortest paths computation. In 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68552-4_24"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1110.0401"},{"key":"e_1_3_2_1_30_1","volume-title":"ACM-SIAM Symposium on Discrete Algorithms (SODA)","volume":"5","author":"Goldberg Andrew V","year":"2005","unstructured":"Andrew V Goldberg and Chris Harrelson. 2005. Computing the shortest path: A search meets graph theory. In ACM-SIAM Symposium on Discrete Algorithms (SODA), Vol. 5. 156--165."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972863.13"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v30i1.10436"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/VNIS.1994.396824"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.3115\/1073445.1073461"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972870.4"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICICCS51141.2021.9432275"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772751"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13818-8_11"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01553908"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2093973.2094062"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230230205"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/BigData47090.2019.9006359"},{"key":"e_1_3_2_1_44_1","volume-title":"BEAD: Batched Evaluation of Iterative Graph Queries with Evolving Analytics Demands. In 2020 IEEE International Conference on Big Data (Big Data). IEEE, 461--468","author":"Mazloumi Abbas","year":"2020","unstructured":"Abbas Mazloumi, Chengshuo Xu, Zhijia Zhao, and Rajiv Gupta. 2020. BEAD: Batched Evaluation of Iterative Graph Queries with Evolving Analytics Demands. In 2020 IEEE International Conference on Big Data (Big Data). IEEE, 461--468."},{"key":"e_1_3_2_1_45_1","unstructured":"Robert Meusel Oliver Lehmberg Christian Bizer and Sebastiano Vigna. 2014. Web Data Commons --- Hyperlink Graphs. http:\/\/webdatacommons.org\/hyperlinkgraph."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-6774(03)00076-2"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"crossref","unstructured":"Joseph SB Mitchell et al. 2000. Geometric Shortest Paths and Network Optimization. Handbook of computational geometry 334 (2000) 633--702.","DOI":"10.1016\/B978-044482537-7\/50016-4"},{"key":"e_1_3_2_1_48_1","volume-title":"Finding the shortest route between two points in a network. The computer journal 9, 3","author":"Nicholson T Alastair J","year":"1966","unstructured":"T Alastair J Nicholson. 1966. Finding the shortest route between two points in a network. The computer journal 9, 3 (1966), 275--280."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511819346"},{"key":"e_1_3_2_1_50_1","unstructured":"OpenStreetMap contributors. 2010. OpenStreetMap. https:\/\/www.openstreetmap.org\/."},{"key":"e_1_3_2_1_51_1","volume-title":"Heuristics: intelligent search strategies for computer problem solving","author":"Pearl Judea","unstructured":"Judea Pearl. 1984. Heuristics: intelligent search strategies for computer problem solving. Addison-Wesley Longman Publishing Co., Inc."},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"crossref","unstructured":"Ira Pohl. 1969. Bi-directional and heuristic search in path problems. Technical Report. Stanford Linear Accelerator Center Calif.","DOI":"10.2172\/4785039"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.253"},{"key":"e_1_3_2_1_54_1","unstructured":"Luis Henrique Oliveira Rios and Luiz Chaimowicz. 2011. Pnba*: A parallel bidirectional heuristic search algorithm. In ENIA VIII Encontro Nacional de Intelig\u00ea ncia Artificial."},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1998.0968"},{"key":"e_1_3_2_1_56_1","volume-title":"Reducing Contention Through Priority Updates. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 152--163","author":"Shun Julian","unstructured":"Julian Shun, Guy E. Blelloch, Jeremy T. Fineman, and Phillip B. Gibbons. 2013. Reducing Contention Through Priority Updates. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 152--163."},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735496.2735507"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063834"},{"key":"e_1_3_2_1_59_1","volume-title":"Parallel bidirectional dijkstra's shortest path algorithm","author":"Vaira Gintaras","unstructured":"Gintaras Vaira and Olga Kurasova. 2011. Parallel bidirectional dijkstra's shortest path algorithm. In Databases and Information Systems VI. IOS Press, 422--435."},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/3469379.3469384"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1109\/HiPC50609.2020.00014"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2022.01.007"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/3297858.3304012"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-013-0693-z"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1080\/13658810801949850"},{"key":"e_1_3_2_1_66_1","volume-title":"Multi Bucket Queues: Efficient Concurrent Priority Scheduling. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 113--124","author":"Zhang Guozheng","year":"2024","unstructured":"Guozheng Zhang, Gilead Posluns, and Mark C Jeffrey. 2024. Multi Bucket Queues: Efficient Concurrent Priority Scheduling. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 113--124."},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1145\/3368826.3377909"},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367532"}],"event":{"name":"SPAA '25: 37th ACM Symposium on Parallelism in Algorithms and Architectures","location":"Portland OR USA","acronym":"SPAA '25","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"]},"container-title":["Proceedings of the 37th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3694906.3743311","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T19:19:44Z","timestamp":1777922384000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3694906.3743311"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,16]]},"references-count":68,"alternative-id":["10.1145\/3694906.3743311","10.1145\/3694906"],"URL":"https:\/\/doi.org\/10.1145\/3694906.3743311","relation":{},"subject":[],"published":{"date-parts":[[2025,7,16]]},"assertion":[{"value":"2025-07-16","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}