Shortest path algorithms: engineering aspects
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1003284
- Shortest paths algorithms: Theory and experimental evaluation
- Faster algorithms for the shortest path problem
- Comparaison d'algorithmes de plus courts chemins sur des graphes routiers de grande taille
- A Practical Shortest Path Algorithm with Linear Expected Time
Cited in
(11)- A computational study of efficient shortest path algorithms
- A zero-space algorithm for negative cost cycle detection in networks
- On contrasting vertex contraction with relaxation-based approaches for negative cost cycle detection
- Engineering Label-Constrained Shortest-Path Algorithms
- A Practical Shortest Path Algorithm with Linear Expected Time
- Via Detours to I/O-Efficient Shortest Paths
- Implementations of Dijkstra's algorithm based on multi-level buckets
- Improved Algorithms for Detecting Negative Cost Cycles in Undirected Graphs
- Engineering multilevel overlay graphs for shortest-path queries
- Two-level heaps: a new priority queue structure with applications to the single source shortest path problem
- Exploring monotone priority queues for Dijkstra optimization
This page was built for publication: Shortest path algorithms: engineering aspects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4474117)