Distance Oracle
[Back to full publication list]
Techniques for distance oracles, such as 2-hop distances, landmark labeling, bidirectional search, A* search, contraction, hierarchies, etc.
- 2025:[4] Parallel Point-to-Point Shortest Paths and Batch Queries (To Appear)
Xiaojun Dong*, Andy Li*, Yan Gu*, and Yihan Sun*
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2025DOI:10.1145/3694906.3743311Software Library:Orionet: Parallel Single and Batch PPSP [Github]
Paper ArXiV Code -
[3]
Parallel Contraction Hierarchies Can Be Efficient and Scalable
Zijin Wan*, Xiaojun Dong*, Letong Wang*, Enzuo Zhu*, Yan Gu*, and Yihan Sun*🏆 Best Paper Finalist!International Conference on Supercomputing (ICS), 2025DOI:10.1145/3721145.3725744Software Library:SPoCH: Scalable Parallelization of Contraction Hierarchies [Github]
Poster and oral presentation at the Highlights of Parallel Computing (HOPC@SPAA), 2025
Paper ArXiV Code Slides -
[2]
Parallel Cluster-BFS and Applications to Shortest Paths
Letong Wang*, Guy E. Blelloch, Yan Gu*, and Yihan Sun*
Algorithm Engineering and Experiments (ALENEX), 2025DOI:10.1137/1.9781611978339.4Software Library:CBFS: Cluster Breadth-First Search [Zenodo]
Paper ArXiV Code Slides - 2021:[1] The Read-Only Semi-External Model
Guy E. Blelloch, Laxman Dhulipala, Phillip B. Gibbons, Yan Gu*, Charles McGuffey, and Julian Shun
ACM-SIAM Algorithmic Principles of Computer Systems (APOCS), 2021
Paper