Author:
Dündar Günhan,Unutulmaz Ahmet
Reference102 articles.
1. C.Y. Lee. An algorithm for path connection and its applications. Electronic Computers, IRE Transactions on, EC-10:346–365, 1961
2. E.F. Moore. The shortest path through a maze. In Proceedings of the International Symposium on the Theory of Switching, pages 285–292, 1959
3. S. Akers. Design Automation of Digital Systems: Theory and Techniques, volume 1, chapter 6. Prentice-Hall, NJ, 1972
4. S. Akers. A modification of Lee’s path connection algorithm. Electronic Computers, IEEE Transactions on, EC-16(2):97–98, 1967
5. F.O. Hadlock. A shortest path algorithm for grid graphs. Networks, 7(4):323–334, 1977