Note on ``A new bidirectional algorithm for shortest paths''
type: Item
instance of: scholarly article
title: Note on ``A new bidirectional algorithm for shortest paths''
zbMATH Open document ID: 1206.90054
author: Wim Pijls
author: Henk Post
published in: European Journal of Operational Research
publication date: 2010-09-09T00:00:00Z
Mathematics Subject Classification ID: 90B40
zbMATH DE Number: 5781918
zbMATH Keywords: shortest path
zbMATH Keywords: bidirectional search
zbMATH Keywords: road network search
MaRDI profile type: Publication
full work available at URL: j.ejor.2010.06.003
OpenAlex ID: W2036948598
cites work: Computing the shortest path: \(A^\ast\) search meets graph theory
cites work: A new bidirectional search algorithm with shortened postprocessing
DOI: 10.1016/J.EJOR.2010.06.003
Recommended article: Q3746901
Recommended article: A bidirectional shortest-path algorithm with good average-case behavior
Recommended article: A note on k-shortest paths problem
Recommended article: A new algorithm for the shortest‐path problem
Recommended article: An exact bidirectional pulse algorithm for the constrained shortest path
Recommended article: Finding the k shortest simple paths
Recommended article: An Appraisal of Some Shortest-Path Algorithms
Recommended article: Shortest‐path methods: Complexity, interrelations and new propositions
Recommended article: On the equivalence between some shortest path algorithms
Recommended article: Computing almost shortest paths (extended abstract)
description: scientific article; zbMATH DE number 5781918