Computation of shortest path in cellular automata
From MaRDI portal
Publication:1914940
DOI10.1016/0895-7177(96)00006-4zbMath0847.68072OpenAlexW2082756313MaRDI QIDQ1914940
Publication date: 4 August 1996
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0895-7177(96)00006-4
Related Items (5)
A hill-jump algorithm of Hopfield neural network for shortest path problem in communication network ⋮ How cellular automaton plays minesweeper ⋮ A survey of cellular automata: types, dynamics, non-uniformity and applications ⋮ Fuzzy reliability analysis using cellular automata for network systems ⋮ Phototaxis of mobile excitable lattices
Uses Software
Cites Work
- Unnamed Item
- A note on two problems in connexion with graphs
- An incremental mechanical development of systolic solutions to the algebraic path problem
- A distributed shortest path algorithm for a planar network
- Reversible cellular automata and chemical turbulence
- An O(m log log D) algorithm for shortest paths
- A cellular automaton model of excitable media. II: Curvature, dispersion, rotating waves and meandering waves
- A cellular automaton model of excitable media. III: Fitting the Belousov- Zhabotinskii reaction
- Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
- An All Pairs Shortest Path Algorithm with Expected Time $O(n^2 \log n)$
- Algorithms for weighted graph problems on the modified cellular graph automaton
- New Bounds on the Complexity of the Shortest Path Problem
- Efficient Algorithms for Shortest Paths in Sparse Networks
This page was built for publication: Computation of shortest path in cellular automata
