A new algorithm for the shortest-path problem
From MaRDI portal
Publication:5226586
DOI10.1002/NET.21870zbMATH Open1418.90273OpenAlexW2905964455MaRDI QIDQ5226586FDOQ5226586
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
Recommendations
shortest pathscombinatorial algorithmsnegative cyclespractical efficiencyadmissible graphlabeling methods
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
- Title not available (Why is that?)
- Efficient Algorithms for Solving the Shortest Covering Path Problem
- Title not available (Why is that?)
- Improvement and experimental evaluation on classical Bellman-Ford algorithm
- Note on ``A new bidirectional algorithm for shortest paths
- A novel pseudo‐polynomial approach for shortest path problems
- A bidirectional shortest-path algorithm with good average-case behavior
- A new algorithm for reoptimizing shortest paths when the arc costs change
- A novel single source shortest path algorithm
- Title not available (Why is that?)
- A faster algorithm for the single source shortest path problem with few distinct positive lengths
- Title not available (Why is that?)
- Title not available (Why is that?)
- Finding the shortest path by Adhwarjee's algorithm and comparison of this powerful method with Dijkstra's algorithm
- 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)
