An improvement on fixed order Bellman-Ford algorithm

zbMATH Open1324.90015MaRDI QIDQ5260174FDOQ5260174

Authors: Weiyi Han 

Publication date: 29 June 2015

Recommendations

• Improvement and experimental evaluation on classical Bellman-Ford algorithm
• Hybrid Bellman-Ford-Dijkstra algorithm
• Randomized Speedup of the Bellman–Ford Algorithm
• Recognizing Bellman–Ford-Orderable Graphs
• A new algorithm for the shortest-path problem

zbMATH Keywords

shortest path problemFIFO orderfixed orderBellman-Ford algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06)

Cited In (2)

• Randomized Speedup of the Bellman–Ford Algorithm
• Hybrid Bellman-Ford-Dijkstra algorithm

This page was built for publication: An improvement on fixed order Bellman-Ford algorithm

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