Skip Navigation

The Computer Journal 1977 20(2):148-150; doi:10.1093/comjnl/20.2.148
© 1977 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by de Champeux, D.
Right arrow Articles by Sint, L.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

An optimality theorem for a bi-directional heuristic search algorithm

D. de Champeux * and L. Sint *

Instituut voor Bedrijfsinformatica en Accountancy, Universteit van Amsterdam, Jodenbreestraat, Netherlands

An optimality theorem and its supporting lemma's are given and proved which apply on a bi-directional heuristic search algorithm.

Received November 1975.

* Instituut voor Bedrijfsinformatica en Accountancy, Universiteit van Amsterdam, Jodenbreestraat 23, Netherlands


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.