Parallel Contraction Hierarchies Can Be Efficient and Scalable
Contraction Hierarchies (CH)(Geisberger et al., 2008) is one of the most widely used
algorithms for shortest-path queries on road networks. Compared to Dijkstra's algorithm, CH …
algorithms for shortest-path queries on road networks. Compared to Dijkstra's algorithm, CH …
[PDF][PDF] Parallel Algorithms Can Be Provably Fast and Scalable
X Dong - Proceedings of the VLDB Endowment. ISSN - vldb.org
As multi-core processors become more widely available, parallel computing has entered its
prime era. Despite significant advances in hardware and extensive theoretical research …
prime era. Despite significant advances in hardware and extensive theoretical research …