Improvement and experimental evaluation on classical Bellman-Ford algorithm

MaRDI QIDQ4926607zbMATH OpenFDO

Authors Weiyi Han

Publication date 20 June 2013

zbMATH Keywords

Bellman-Ford algorithmpartitioning algorithmthe shortest path problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35)

Recommendations

• An improvement on fixed order Bellman-Ford algorithm
• A new algorithm for the shortest-path problem
• Hybrid Bellman-Ford-Dijkstra algorithm
• On the optimality of Bellman-Ford-Moore shortest path algorithm
• A computational improvement for a shortest paths ranking algorithm

Cited in

(2)

• Randomized Speedup of the Bellman–Ford Algorithm
• An improvement on fixed order Bellman-Ford algorithm

This page was built for publication: Improvement and experimental evaluation on classical Bellman-Ford algorithm

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