Experimental evaluation of a new shortest path algorithm
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1003284
- Shortest paths algorithms: Theory and experimental evaluation
- Comparaison d'algorithmes de plus courts chemins sur des graphes routiers de grande taille
- A new algorithm for the shortest-path problem
- Power balance and apportionment algorithms for the United States Congress
Cited in
(12)- A new approach to all-pairs shortest paths on real-weighted graphs
- Shortest paths algorithms: Theory and experimental evaluation
- scientific article; zbMATH DE number 1003284 (Why is no real title available?)
- scientific article; zbMATH DE number 613343 (Why is no real title available?)
- scientific article; zbMATH DE number 1766771 (Why is no real title available?)
- A new algorithm for the shortest-path problem
- Shortest path feasibility algorithms: an experimental evaluation
- Shortest-path feasibility algorithms, an experimental evaluation
- scientific article; zbMATH DE number 6469167 (Why is no real title available?)
- Comparaison d'algorithmes de plus courts chemins sur des graphes routiers de grande taille
- Modifications of the Floyd-Warshall algorithm with nearly quadratic expected-time
- A faster algorithm for the single source shortest path problem with few distinct positive lengths
This page was built for publication: Experimental evaluation of a new shortest path algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4707795)