A new algorithm for the shortest-path problem

DOI10.1002/NET.21870MaRDI QIDQ5226586zbMATH OpenOpenAlexFDO

Authors Amr Elmasry, Ahmed Shokry

Publication date 1 August 2019

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.21870

zbMATH Keywords

shortest pathscombinatorial algorithmsnegative cyclespractical efficiencyadmissible graphlabeling methods

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• scientific article; zbMATH DE number 3937196
• scientific article; zbMATH DE number 613343
• A novel single source shortest path algorithm
• Scaling Algorithms for the Shortest Paths Problem
• scientific article; zbMATH DE number 1926665

Cited in

(18)

• On the optimality of Bellman-Ford-Moore shortest path algorithm
• A Simpler and More Efficient Algorithm for the Next-to-Shortest Path Problem
• An improvement on fixed order Bellman-Ford algorithm
• scientific article; zbMATH DE number 1766771 (Why is no real title available?)
• Efficient Algorithms for Solving the Shortest Covering Path Problem
• scientific article; zbMATH DE number 4016203 (Why is no real title available?)
• Improvement and experimental evaluation on classical Bellman-Ford algorithm
• Note on ``A new bidirectional algorithm for shortest paths
• A bidirectional shortest-path algorithm with good average-case behavior
• A novel pseudo‐polynomial approach for shortest path problems
• A new algorithm for reoptimizing shortest paths when the arc costs change
• A novel single source shortest path algorithm
• A faster algorithm for the single source shortest path problem with few distinct positive lengths
• scientific article; zbMATH DE number 1926665 (Why is no real title available?)
• scientific article; zbMATH DE number 1093953 (Why is no real title available?)
• Finding the shortest path by Adhwarjee's algorithm and comparison of this powerful method with Dijkstra's algorithm
• scientific article; zbMATH DE number 2096648 (Why is no real title available?)
• A novel linear algorithm for shortest paths in networks

This page was built for publication: A new algorithm for the shortest-path problem

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