Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

An optimality theorem for a bi-directional heuristic search algorithm

From MaRDI portal
Publication:4122792
Jump to:navigation, search

DOI10.1093/COMJNL/20.2.148zbMATH Open0352.68056OpenAlexW2146169650MaRDI QIDQ4122792FDOQ4122792


Authors: Dennis De Champeaux, Lenie Sint Edit this on Wikidata


Publication date: 1977

Published in: The Computer Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/comjnl/20.2.148





Mathematics Subject Classification ID

Algorithms in computer science (68W99)



Cited In (2)

  • MM: a bidirectional search algorithm that is guaranteed to meet in the middle
  • Symmetric connection problems and their solution by bidirectional search





This page was built for publication: An optimality theorem for a bi-directional heuristic search algorithm

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4122792&oldid=17908560"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 6 February 2024, at 08:33. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki