Geometric speed-up techniques for finding shortest paths in large sparse graphs
From MaRDI portal
Recommendations
- Experimental and Efficient Algorithms
- Comparaison d'algorithmes de plus courts chemins sur des graphes routiers de grande taille
- Goal-directed shortest-path queries using precomputed cluster distances
- Geometric containers for efficient shortest-path computation
- Speed-Up Techniques for Shortest-Path Computations
Cited in
(16)- A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing
- Subregion graph: a path planning acceleration structure for characters with various motion types in very large environments
- Efficient computation of geodesic shortest paths
- Levelwise mesh sparsification for shortest path queries
- scientific article; zbMATH DE number 437554 (Why is no real title available?)
- Speed-Up Techniques for Shortest-Path Computations
- Engineering Route Planning Algorithms
- Efficient Algorithms for Geometric Graph Search Problems
- Shortest-path queries in static networks
- Goal Directed Shortest Path Queries Using Precomputed Cluster Distances
- Acceleration of the A^*-algorithm for the shortest path problem in digital road maps
- Goal-directed shortest-path queries using precomputed cluster distances
- Experimental and Efficient Algorithms
- Geometric containers for efficient shortest-path computation
- Fundamentals of Computation Theory
- Space-efficient algorithms for reachability in directed geometric graphs
This page was built for publication: Geometric speed-up techniques for finding shortest paths in large sparse graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897292)
