Partitioning graphs to speedup Dijkstra's algorithm

DOI10.1145/1187436.1216585zbMath1140.68420OpenAlexW2091635795MaRDI QIDQ3507777

Birk Schütz, Heiko Schilling, Thomas Willhalm, Rolf H. Möhring, Dorothea Wagner

Publication date: 20 June 2008

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://depositonce.tu-berlin.de/handle/11303/15567

zbMATH Keywords

arc-flag method

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

ILP-Based Local Search for Graph Partitioning ⋮ A novel pseudo‐polynomial approach for shortest path problems ⋮ Metropolized Forest Recombination for Monte Carlo Sampling of Graph Partitions ⋮ Time-dependent SHARC-routing ⋮ Shortest-path queries in static networks ⋮ Engineering Route Planning Algorithms

This page was built for publication: Partitioning graphs to speedup Dijkstra's algorithm