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

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.

• Type: Journal
• Year: 2006
• Where: FUIN
• Authors: Jérémie Chalopin, Yves Métivier, Wieslaw Zielonka
• Keywords: Algorithmic Problems, FUIN 2006, Label, Weakest Vertex