Computation of shortest path in cellular automata
Author:
- A.I. AdamatzkyAAA.I. Adamatzky
- 1 February 1996
- journal article
- Published by Elsevier in Mathematical and Computer Modelling
- Vol. 23 (4) , 105-113
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Shortest-path and minimum-delay algorithms in networks with time-dependent edge-lengthJournal of the ACM, 1990
- A distributed shortest path algorithm for a planar networkInformation and Computation, 1990
- An incremental mechanical development of systolic solutions to the Algebraic Path ProblemActa Informatica, 1989
- An All Pairs Shortest Path Algorithm with Expected Time $O(n^2 \log n)$SIAM Journal on Computing, 1987
- Parallel graph algorithmsACM Computing Surveys, 1984
- An O(mlog logD) algorithm for shortest pathsDiscrete Applied Mathematics, 1983
- Efficient Algorithms for Shortest Paths in Sparse NetworksJournal of the ACM, 1977
- New Bounds on the Complexity of the Shortest Path ProblemSIAM Journal on Computing, 1976
- Algorithm 97: Shortest pathCommunications of the ACM, 1962
- A note on two problems in connexion with graphsNumerische Mathematik, 1959