A Distributed Election and Spanning Tree Algorithm Based on Depth First Search
DAIMI Report Series1987Vol. 16(232)
Abstract
The 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.
Related Papers
- → On external memory graph traversal(2000)110 cited
- → Graph Traversal Techniques and the Maximum Flow Problem in Distributed Computation(1983)104 cited
- → A parallel search algorithm for directed acyclic graphs(1984)48 cited
- → A Novel Agent Based Depth First Search Algorithm(2020)17 cited
- → A Distributed Election and Spanning Tree Algorithm Based on Depth First Search(1987)