An Improved Bidirectional Heuristic Search Algorithm
From MaRDI portal
Publication:4128007
DOI10.1145/322003.322004zbMath0356.68057OpenAlexW2023624803WikidataQ56590834 ScholiaQ56590834MaRDI QIDQ4128007
Dennis De Champeaux, Lenie Sint
Publication date: 1977
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/322003.322004
Related Items
Perimeter search in restricted memory ⋮ \(BS^*:\) An admissible bidirectional staged heuristic search algorithm ⋮ Iterative Deepening Dynamically Improved Bounds Bidirectional Search ⋮ Symmetric connection problems and their solution by bidirectional search ⋮ MM: a bidirectional search algorithm that is guaranteed to meet in the middle ⋮ Computing shortest paths in networks derived from recurrence relations ⋮ Two new bidirectional search algorithms ⋮ Bidirectional heuristic search with limited resources ⋮ Processing time-dependent shortest path queries without pre-computed speed information on road networks ⋮ Heuristic shortest path algorithms for transportation applications: state of the art ⋮ \(\text{BIDA}^*\): An improved perimeter search algorithm
This page was built for publication: An Improved Bidirectional Heuristic Search Algorithm
