Note on ``A new bidirectional algorithm for shortest paths

DOI10.1016/J.EJOR.2010.06.003zbMATH Open1206.90054OpenAlexW2036948598MaRDI QIDQ992737FDOQ992737

Authors: Wim Pijls, Henk Post 

Publication date: 9 September 2010

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2010.06.003

Recommendations

• scientific article; zbMATH DE number 3982535
• A bidirectional shortest-path algorithm with good average-case behavior
• A note on \(k\)-shortest paths problem
• A new algorithm for the shortest-path problem
• An exact bidirectional pulse algorithm for the constrained shortest path
• Finding the k shortest simple paths
• An Appraisal of Some Shortest-Path Algorithms
• Shortest‐path methods: Complexity, interrelations and new propositions
• On the equivalence between some shortest path algorithms
• Computing almost shortest paths (extended abstract)

zbMATH Keywords

shortest pathbidirectional searchroad network search

Mathematics Subject Classification ID

Search theory (90B40)

Cites Work

• Computing the shortest path: \(A^\ast\) search meets graph theory
• A new bidirectional search algorithm with shortened postprocessing

Cited In (4)

• MM: a bidirectional search algorithm that is guaranteed to meet in the middle
• An exact bidirectional pulse algorithm for the constrained shortest path
• A new bidirectional search algorithm with shortened postprocessing
• A bidirectional shortest-path algorithm with good average-case behavior

This page was built for publication: Note on ``A new bidirectional algorithm for shortest paths

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