An improvement of the Roy-Floyd algorithm

MaRDI QIDQ5309414zbMATH OpenFDO

Authors Gbriela Serban

Publication date 9 October 2007

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• An improvement of Dijkstra's method for finding a shortest path in a graph
• Shortest path methods: A unifying approach
• An intelligent search path
• scientific article; zbMATH DE number 1134692
• The shortest-path problem. Analysis and comparison of methods

Cited in

(6)

• An Improvement of Rosenfeld-Gröbner Algorithm
• scientific article; zbMATH DE number 3848699 (Why is no real title available?)
• scientific article; zbMATH DE number 3986532 (Why is no real title available?)
• Improved Rabin's scheme with high efficiency
• Improved redundancy of a version of the Lempel-Ziv algorithm
• Abstract interpretation of graphs

This page was built for publication: An improvement of the Roy-Floyd algorithm

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