ACM Home Page
Please provide us with feedback. Feedback
Bidirectional Heuristic Search Again
Full text PdfPdf (590 KB)
Source Journal of the ACM (JACM) archive
Volume 30 ,  Issue 1  (January 1983) table of contents
Pages: 22 - 32  
Year of Publication: 1983
ISSN:0004-5411
Author
Dennis de Champeaux  Computer Science Department, School of Engineering, New Orleans, LA and Universiteit van Amsterdam, The Netherlands
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 11,   Downloads (12 Months): 63,   Citation Count: 12
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/322358.322360
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
DE CHAMPEAUX, D., AND SINT, L.An optimality theorem for a bidirectional heuristic search algorithm. Comput. Z 20, 2 (1977), 148-150.
 
3
Do~, J. Double tree searching and the graph traverser. Res. Memo. EPU-R-22, Dep. of Machine intelligence and Perception, Edinburgh Univ., Scotland, 1966.
 
4
 
5
PotIL, I. Bi&rectional heurisuc search in path problems. Ph.D Dissertation, Stanford Univ., Stanford, Calif., 1969.

CITED BY  12

Collaborative Colleagues:
Dennis de Champeaux: colleagues