Time-optimal leader election in general networks
By: Researcher
Disclaimer: The provided code links for this paper are external links. Science Nest has no responsibility for the accuracy, legality or content of these links. Also, by downloading this code(s), you agree to comply with the terms of use as set out by the author(s) of the code(s).
Please contact us in case of a broken link from here
| Authors | David Peleg |
| Journal/Conference Name | Journal of Parallel and Distributed Computing |
| Paper Category | Artificial Intelligence |
| Paper Abstract | 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. |
| Date of publication | 2004 |
| Code Programming Language | Java |
| Comment |
Copyright Researcher 2022