Combining speed-up techniques for shortest-path computations
From MaRDI portal
Publication:3507749
DOI10.1145/1064546.1180616zbMath1140.68552OpenAlexW2166542580MaRDI QIDQ3507749
Frank Schulz, Martin Holzer, Thomas Willhalm, 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://doi.org/10.1145/1064546.1180616
Related Items
Computing source-to-target shortest paths for complex networks in RDBMS ⋮ Shortest-path queries in static networks ⋮ Engineering Route Planning Algorithms ⋮ A NOVEL LINEAR ALGORITHM FOR SHORTEST PATHS IN NETWORKS ⋮ A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing