@article{Skyum_1987, title={A Distributed Election and Spanning Tree Algorithm Based on Depth First Search}, volume={16}, url={https://tidsskrift.dk/daimipb/article/view/7588}, DOI={10.7146/dpb.v16i232.7588}, abstractNote={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.}, number={232}, journal={DAIMI Report Series}, author={Skyum, Sven}, year={1987}, month={Aug.} }