A note on Bertsekas' small-label-first strategy

DOI10.1002/(SICI)1097-0037(199703)29:2%3C111::AID-NET5%3E3.0.CO;2-MzbMATH Open0888.90138OpenAlexW1982630055MaRDI QIDQ4367278FDOQ4367278

Warren Powell, Zhi-Long Chen

Publication date: 25 November 1997

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199703)29:2%3C111::aid-net5%3E3.0.co;2-m

zbMATH Keywords

shortest pathlabeling algorithmworst-case complexity

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

   Recommendations

• A simple and fast label correcting algorithm for shortest paths 👍 👎
• Shortest path algorithms using dynamic breadth‐first search 👍 👎
• Shortest path methods: A unifying approach 👍 👎
• Efficient Shortest Path Simplex Algorithms 👍 👎

This page was built for publication: A note on Bertsekas' small-label-first strategy

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