A cellular automaton that computes shortest paths in grid graph (Q831670)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A cellular automaton that computes shortest paths in grid graph |
scientific article; zbMATH DE number 7497452
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A cellular automaton that computes shortest paths in grid graph |
scientific article; zbMATH DE number 7497452 |
Statements
A cellular automaton that computes shortest paths in grid graph (English)
0 references
24 March 2022
0 references
cellular automata
0 references
grid graph
0 references
shortest paths
0 references
0.8932165503501892
0 references
0.8585474491119385
0 references
0.8009569644927979
0 references
0.7899129390716553
0 references
