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".
Based on the enumeration algorithm, authors in REF introduced the notion of quasi-covering, i.e., which captures the existence of large enough area of one graph that looks locally like another graph, and characterised families of graphs which admit an election algorithm in the message passing model.
Election in partially anonymous networks with arbitrary knowledge in message passing systems
Distributed Computing
Distributed Computing
Engineering Computer Science