Election vs. Selection: How Much Advice is Needed to Find the Largest Node in a Graph?

SPAA, pp. 377-386, 2016.

Cited by: 4|Bibtex|Views3|Links
EI

Abstract:

Finding the node with the largest label in a labeled network, modeled as an undirected connected graph, is one of the fundamental problems in distributed computing. This is the way in which leader election is usually solved. We consider two distinct tasks in which the largest-labeled node is found deterministically. In selection, this nod...More

Code:

Data:

Your rating :
0

 

Tags
Comments