Parallel Contraction Hierarchies Can Be Efficient and Scalable
Open Access
- 8 June 2025
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 670-688
Abstract
No abstract availableAll Related Versions
Funding Information
- National Science Foundation (CCF-2103483, CCF-2238358, CCF-2339310, IIS-2227669, TI-2346223)
- UCR Regents Faculty Fellowship
- UCR Regents Faculty Development Award
- Google Research Scholar Program
This publication has 67 references indexed in Scilit:
- Route Planning in Transportation Networks2016
- Benchmarking for Graph Clustering and Partitioning2014
- Hub Label CompressionLecture Notes in Computer Science, 2013
- Hierarchical Hub Labelings for Shortest Paths2012
- A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks2011
- Distributed Time-Dependent Contraction Hierarchies2010
- Time-Dependent Contraction Hierarchies and ApproximationLecture Notes in Computer Science, 2010
- Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks2008
- Dynamic Highway-Node Routing2007
- Engineering Highway Hierarchies2006