Time-optimal leader election in general networks
David Peleg · Journal of Parallel and Distributed Computing · 1990
This note presents a simple time-optimal distributed algorithm for electing a leader in a general network. For several important classes of networks this algorithm is also message-optimal and thus performs better than previous algorithms for the problem.