Issue No. 07 - July (1968 vol. 17)
B.A. Crane , IEEE
Abstract?This note discusses possible advantages to be gained through use of associative memory in finding the shortest path through a large graph having edges of unequal lengths. An algorithm is described which exploits associative memory's highly parallel search and arithmetic capabilities and which is economical in storage requirements.
Index terms?Associative and content-adressable memory, graphs, highly parallel processing, shortest-path problem.
B. Crane, "Path Finding with Associative Memory," in IEEE Transactions on Computers, vol. 17, no. , pp. 691-693, 1968.