Cellular automata machines for graph theoretic problems.

Authors :: Roy, Souvik
Barman, Debopriya
Das, Sukanta
Source :: International Journal of Parallel, Emergent & Distributed Systems; Jan2024, Vol. 39 Issue 1, p86-105, 20p
Publication Year :: 2024
Abstract: This paper reports a special class of cellular automata machines that can solve graph theoretic problems, such as spanning tree problem and single source shortest path problem. The machine deals with planar graphs only. We first develop two-dimensional cellular automata to solve the graph theoretic problems for planar graphs. Next, we design the hardware for implementation of those cellular automata. [ABSTRACT FROM AUTHOR]

Language :: English
ISSN :: 17445760
Volume :: 39
Issue :: 1
Database :: Complementary Index
Journal :: International Journal of Parallel, Emergent & Distributed Systems
Publication Type :: Academic Journal
Accession number :: 174204380
Full Text :: https://doi.org/10.1080/17445760.2023.2251075