Partitioning graphs to speed up Dijkstra's algorithm
From MaRDI portal
Recommendations
Cited in
(13)- A new bidirectional search algorithm with shortened postprocessing
- 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
- On the complexity of partitioning graphs for arc-flags
- On the complexity of partitioning graphs for arc-flags
- Partitioning graphs to speedup Dijkstra's algorithm
- High-performance multi-level routing
- Engineering Route Planning Algorithms
- Traffic Networks and Flows over Time
- Map partitioning for accelerated routing: measuring relation between tiled and routing partitions
- Time-dependent SHARC-routing
- Geometric speed-up techniques for finding shortest paths in large sparse graphs
- Finding the shortest paths by node combination
This page was built for publication: Partitioning graphs to speed up Dijkstra's algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5710017)