Election vs. Selection: Two Ways of Finding the Largest Node in a Graph

Avery Miller, Andrzej Pelc

Finding the node with the largest label in a network, modeled as an undirected connected graph, is one of the fundamental problems in distributed computing. This is the way in whic…