nanoll
extt
Contact admin for Full-Text
Please use this identifier to cite or link to this item:
http://lrcdrs.bennett.edu.in:80/handle/123456789/5042| Title: | Cellular automata machines for graph theoretic problems |
| Authors: | Roy, Souvik |
| Keywords: | Cellular automaton cellular automata machine |
| Issue Date: | 2023 |
| Publisher: | International Journal of Parallel, Emergent and Distributed Systems |
| Abstract: | This paper reports a special class of cellular automata machines that can solve graph theoretic problems, such as spanning tree problem and sin gle 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. |
| URI: | https://doi.org/10.1080/17445760.2023.2251075 http://lrcdrs.bennett.edu.in:80/handle/123456789/5042 |
| ISSN: | 1744-5760 |
| Appears in Collections: | Conference/Seminar Papers_ SCSET |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Cellular automata machines for graph theoretic problems.pdf Restricted Access | 2.42 MB | Adobe PDF | View/Open Request a copy |
Contact admin for Full-Text
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.