Computation of shortest path in cellular automata
From MaRDI portal
Publication:1914940
DOI10.1016/0895-7177(96)00006-4zbMATH Open0847.68072OpenAlexW2082756313MaRDI QIDQ1914940FDOQ1914940
Authors: Andrew Adamatzky 
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
Recommendations
- Computing shortest paths with cellular automata
- A cellular automaton that computes shortest paths in grid graph
- CELLULAR AUTOMATA AND OPTIMAL PATH PLANNING
- A novel method for solving the monophyletic shortest path problem based on cellular automata
- A Maze Routing Algorithm Based on Two Dimensional Cellular Automata
Cites Work
- A note on two problems in connexion with graphs
- Efficient Algorithms for Shortest Paths in Sparse Networks
- Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
- New Bounds on the Complexity of the Shortest Path Problem
- An incremental mechanical development of systolic solutions to the algebraic path problem
- A cellular automaton model of excitable media. II: Curvature, dispersion, rotating waves and meandering waves
- An All Pairs Shortest Path Algorithm with Expected Time $O(n^2 \log n)$
- A distributed shortest path algorithm for a planar network
- Reversible cellular automata and chemical turbulence
- Title not available (Why is that?)
- An O(m log log D) algorithm for shortest paths
- A cellular automaton model of excitable media. III: Fitting the Belousov- Zhabotinskii reaction
- Algorithms for weighted graph problems on the modified cellular graph automaton
Cited In (10)
- Phototaxis of mobile excitable lattices
- A cellular automaton that computes shortest paths in grid graph
- A hill-jump algorithm of Hopfield neural network for shortest path problem in communication network
- A novel method for solving the monophyletic shortest path problem based on cellular automata
- How cellular automaton plays minesweeper
- Computing shortest paths with cellular automata
- Algorithms for weighted graph problems on the modified cellular graph automaton
- A survey of cellular automata: types, dynamics, non-uniformity and applications
- Shortest-Path-Finder Algorithm in a Two-Dimensional Array of Nonlinear Electronic Circuits
- Fuzzy reliability analysis using cellular automata for network systems
Uses Software
This page was built for publication: Computation of shortest path in cellular automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1914940)
