Abstract This paper attempts to find an answer to an open question of Angluin in her seminal paper (1980) about the election problem for families of graphs (Section 4, page 87). More precisely, we characterize families of (labelled) graphs which admit an election algorithm in the message passing model by using the notion of quasi-coverings which captures "the existence of large enough area of one graph that looks locally like another graph".
A characterisation of families of graphs which admit an election algorithm (i.e., the same algorithm works on each graph of the family) has been obtained in REF .
Election in partially anonymous networks with arbitrary knowledge in message passing systems
Distributed Computing
Distributed Computing
Engineering Computer Science