Universal Election Algorithm using an auxiliary graph
968
Abstract
We consider finite connected undirected graphs as a model for computer networks. In this framework we show a general-purpose distributed election algorithm, which uses a locally built auxiliary graph.
