Election, Naming and Cellular Edge Local Computations

Jérémie Chalopin (1) , Yves Métivier (2) , Wieslaw Zielonka (3)

1 LIF - Laboratoire d'informatique Fondamentale de Marseille - UMR 6166
2 LaBRI - Laboratoire Bordelais de Recherche en Informatique
3 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications

We examine the power and limitations of the weakest vertex relabelling system which allows to change a label of a vertex in function of its own label and of the label of one of its neighbours. We characterise the graphs for which two important distributed algorithmic problems are solvable in this model: naming and election.

Domaines: Autre [cs.OH]; Calcul parallèle, distribué et partagé [cs.DC]

Jérémie Chalopin, Yves Métivier, Wieslaw Zielonka. Election, Naming and Cellular Edge Local Computations. International Conference on Graph Transformation (ICGT 2004) (EATCS best paper award), Sep 2004, Italy. pp.242--256. ⟨hal-00308119⟩