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.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call