| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6874338 | Journal of Computational Science | 2018 | 16 Pages |
Abstract
This work introduces the distributed spanning tree problem in the domain of cellular automata. We present a cellular automaton that computes a spanning tree of a given (grid) graph. The time required for this computation is O(nlogn), where n is the number of nodes of the graph.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Souvik Roy, Arunima Ray, Sukanta Das,