Shortest path feasibility algorithms: an experimental evaluation

DOI10.1137/1.9781611972887.12MaRDI QIDQ5233514zbMATH OpenOpenAlexFDO

Authors Boris V. Cherkassky, Loukas Georgiadis, Andrew V. Goldberg, Renato F. Werneck, Robert E. 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

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

Recommendations

• Shortest-path feasibility algorithms, an experimental evaluation
• scientific article; zbMATH DE number 1003284
• Shortest paths algorithms: Theory and experimental evaluation
• scientific article; zbMATH DE number 1926665
• Shortest paths in almost acyclic graphs

Cited in

(6)

• Shortest path solvers. From software to wetware
• scientific article; zbMATH DE number 1003284 (Why is no real title available?)
• Shortest path reoptimization vs resolution from scratch: a computational comparison
• Hybrid Bellman-Ford-Dijkstra algorithm
• An experimental study of minimum mean cycle algorithms
• Shortest-path feasibility algorithms, an experimental evaluation

This page was built for publication: Shortest path feasibility algorithms: an experimental evaluation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5233514)