A Distributed Election and Spanning Tree Algorithm Based on Depth First Search
AbstractThe existence of an effective traversal algorithm for a class of graphs has proven useful in connection with election problems for those classes. In this paper we show how a general traversal algorithm, such as depth first search, can be turned into an effective election algorithm using modular techniques. The presented method also constructs a spanning tree for the graph.
How to Cite
Skyum, S. (1987). A Distributed Election and Spanning Tree Algorithm Based on Depth First Search. DAIMI Report Series, 16(232). https://doi.org/10.7146/dpb.v16i232.7588
Articles published in DAIMI PB are licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.