Symmetric connection problems and their solution by bidirectional search

DOI10.1080/00207169008803942zbMath0723.68095OpenAlexW1990520601MaRDI QIDQ3210917

Dieter Müller

Publication date: 1990

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169008803942

zbMATH Keywords

optimality theoremBidirectional searchpassenger information systems

Mathematics Subject Classification ID

Searching and sorting (68P10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

Time depending shortest-path problems with applications to railway networks

Cites Work

• Unnamed Item
• Shortest-path algorithms: Taxonomy and annotation
• An optimality theorem for a bi-directional heuristic search algorithm
• An Improved Bidirectional Heuristic Search Algorithm

This page was built for publication: Symmetric connection problems and their solution by bidirectional search