Shortest Path Feasibility Algorithms: An Experimental Evaluation

DOI10.1137/1.9781611972887.12zbMath1427.68351OpenAlexW2222522247MaRDI QIDQ5233514

Renato F. Werneck, Loukas Georgiadis, Boris V. Cherkassky, Andrew V. Goldberg, Robert Endre Tarjan

Publication date: 11 September 2019

Published in: 2008 Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611972887.12

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Hybrid Bellman-Ford-Dijkstra algorithm