Local Computations in Graphs: The Case of Cellular Edge Local Computations

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

1 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications
2 LaBRI - Laboratoire Bordelais de Recherche en Informatique

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 characterize the graphs for which two important distributed algorithmic problems are solvable in this model : naming and election.

Mots clés: local computations; distributed computations

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

Wieslaw Zielonka, Yves Métivier, Jérémie Chalopin. Local Computations in Graphs: The Case of Cellular Edge Local Computations. Fundamenta Informaticae, 2006, 74 (1), pp.85-114. ⟨hal-00160439⟩