Symmetric connection problems and their solution by bidirectional search

References

• Nilsson , N.J. 1971 . Problem-solving Methods in Artificial Intelligence , McGraw-Hill .
   Google Scholar
• Pearl , J. 1985 . Heuristics , Addison-Wesley .
   Google Scholar
• Hart , P.E. , Nilsson , H.J. and Raphael , B . 1968 . A formal basis for the heuristic delermination of minimum cost paths . IEEE Trans. Systems Science and Cybernetics , SSC-4 ( 2 ) : 100 – 107 .
   Web of Science ®Google Scholar
• Pohl , I. 1971 . Bidirectional search. Machine Intelligence , Edited by: Meltzer , D. and Michie , D. Am.Elsevier .
   Google Scholar
• De Champeaux , D. and Sint , L. 1977 . An improved bidireclional heuristic search algorithm . JACM , 24 ( 2 ) : 177 – 191 .
   Google Scholar
• De Champeaux , D. and Sint , L . 1977 . An optimaiity theorem for a bidirectional heuristic search algorithm . Comput. J , 20 ( 2 ) : 148 – 150 .
   Web of Science ®Google Scholar
• Deo , N. and Pang , C. 1980 . Shortest Path Algorithms: Taxonomy and Annotation , Washington State University . CS-80-057, Computer Science Depl
   Google Scholar
• Kretschmer , W. 1987 . Systementwicklungen für die Eisenbahn . Eisenbahntechnische Rundschau , 36 ( 12 ) : 801 – 802 .
   Google Scholar