|
Dobiesław Wróblewski
Universal Election Algorithm
967
Abstract
We consider undirected connected graphs as natural model for computer networks. For this model, the distributed election algorithm is presented, its correctness is proved and its complexity is discussed.
Keywords : distributed computing, election, enumeration, ambiguous graphs.
|
|
 |
 |