SHARC: Fast and Robust Unidirectional Routing

DOI10.1137/1.9781611972887.2zbMath1427.68228OpenAlexW2288961969MaRDI QIDQ5233507

Daniel Delling, Reinhard Bauer

Publication date: 11 September 2019

Published in: 2008 Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611972887.2

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

A Lower Bound for the Query Phase of Contraction Hierarchies and Hub Labels ⋮ Bidirectional A  ∗  Search for Time-Dependent Fast Paths ⋮ Time-Dependent SHARC-Routing ⋮ Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks

This page was built for publication: SHARC: Fast and Robust Unidirectional Routing