Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs (2003)

by Dorothea Wagner , Thomas Willhalm
Citations:43 - 14 self

Documents Related by Co-Citation

1011 A Note on Two Problems in Connexion with Graphs – E. W. Dijkstra - 1959
40 Reach-Based Routing: A New Approach to Shortest Path Algorithms Optimized for Road Networks – R J Gutman - 2004
43 An extremely fast, exact algorithm for finding shortest paths in static networks with geographical background, in Geoinformation und Mobilität - von der Forschung zur praktischen Anwendung – U Lauther - 2004
37 Partitioning graphs to speed up Dijkstra’s algorithm – R H Möhring, H Schilling, B Schütz, D Wagner, T Willhalm - 2005
49 Reach for A∗: Efficient point-to-point shortest path algorithms – Andrew V. Goldberg, Haim Kaplan, Renato F. Werneck - 2006
74 Computing the shortest path: A* search meets graph theory – Andrew V. Goldberg, Chris Harrelson - 2005
54 Highway hierarchies hasten exact shortest path queries – P Sanders, D Schultes - 2005
40 Engineering Highway Hierarchies – P Sanders, D Schultes - 2006
728 A Formal Basis for the Heuristic Determination of Minimum Cost Paths – P E Hart, N J Nilsson, B Raphael - 1968
53 Hierarchical encoded path views for path query processing: An optimal model and its performance evaluation – Ning Jing, Yun-wu Huang, Elke A. Rundensteiner - 1998
43 Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport – Frank Schulz, Dorothea Wagner, Karsten Weihe - 2000
18 Using multi-level graphs for timetable information – F Schulz, D Wagner, C D Zaroliagis - 2002
593 LEDA: A Platform for Combinatorial and Geometric Computing – Kurt Mehlhorn, Stefan Näher, Christian Uhrig - 1999
18 Combining Speed-Up Techniques for Shortest-Path Computations – Martin Holzer, Frank Schulz, Thomas Willhalm - 2004
22 Using Multi-level Graphs for Timetable Information in Railway Systems – Frank Schulz, Dorothea Wagner, Christos Zaroliagis - 2002
21 Engineering multi-level overlay graphs for shortest-path queries – Martin Holzer, Frank Schulz, Dorothea Wagner - 2006
26 Computing Point-to-Point Shortest Paths from External Memory – Andrew V Goldberg, Renato F Wernecky - 2005
18 Computing the shortest path: A ∗ meets graph theory – A V Goldberg, C Harrelson - 2005
9 A comparison between label-setting and label-correcting algorithms for computing one-to-one shortest paths – F B Zahn, C E Noon - 2000