Speed-Up Techniques for Shortest-Path Computations

DOI10.1007/978-3-540-70918-3_3zbMath1186.68594OpenAlexW2110452945MaRDI QIDQ3590919

Thomas Willhalm, Dorothea Wagner

Publication date: 3 September 2007

Published in: STACS 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70918-3_3

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Bidirectional A  ∗  Search for Time-Dependent Fast Paths, OPTIMAL ROUTING BY LANDMARKS IN THE TIME-DEPENDENT NETWORKS, Shortest-path queries in static networks, The Shortcut Problem – Complexity and Approximation, LunarVis – Analytic Visualizations of Large Graphs, Subregion graph: a path planning acceleration structure for characters with various motion types in very large environments, Disk-based shortest path discovery using distance index over large dynamic graphs, A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing, Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks