A Distributed Election and Spanning Tree Algorithm Based on Depth First Search Traversals

Research output: Book/anthology/dissertation/reportReport

  • Department of Computer Science
The existence of an effective distributed 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.
Original languageEnglish
PublisherDepartment of Computer Science, Aarhus University
Number of pages11
Publication statusPublished - 1987

See relations at Aarhus University Citationformats

ID: 37371519