Leader Election on a Synchronous Anonymous Network with a Known Number of Arcs

Electing a leader on a network of processors means finding a configuration with just one processar in a distinguished state. In this work we analyze the leader election problem on anonymous synchronous networks, i.e. synchronous networks of indistinguishable processors. We propose an algorithm which carries out a leader election on a synchronous anonymous network with no assumption about its topology, we only need to know the number E of its arcs.