دانلود A cellular automaton that solves distributed spanning tree problem
عنوان انگليسي
:
A cellular automaton that solves distributed spanning tree problem
چکیده
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(n log n), where n is the number of nodes of the graph.
Keywords:
Cellular automata (CAs) Anonymous systems Concurrent initiator distributed spanning
سایر منابع مهندسی کامپیوتر و IT در زمینه اتوماتای سلولی