Election and Local Computations on Edges

Abstract

International audienceThe point of departure and the motivation for this paper are the results of Angluin [1] which has introduced a tool to analyze the election algorithm: the coverings, Yamashita and Kameda [21] and Mazurkiewicz [15] which have obtained characterizations of graphs in which election is possible under two different models of distributed computations. Our aim is twofold. First it is to obtain characterizations of graphs in which election is possible under intermediate models between the models of Yamashita-Kameda and of Mazurkiewicz. Our second aim is to understand the implications of the models for the borderline between positive and negative results for distributed computations. In this work, characterizations are obtained under three different models