%0 Conference Proceedings %F CHALOPIN_2004_HAL-00308119_1 %A Chalopin, Jérémie %A Métivier, Yves %A Zielonka, Wieslaw %T {E}lection, {N}aming and {C}ellular {E}dge {L}ocal {C}omputations %B {G}raph transformation {I}nternational {C}onference on {G}raph {T}ransformation ({ICGT} 2004) ({EATCS} best paper award) %V 3256 %P 242-256 %S {L}ecture notes in computer science %I {S}pringer %C {I}talie %X {W}e 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. {W}e characterise the graphs for which two important distributed algorithmic problems are solvable in this model: naming and election. %U http://hal.archives-ouvertes.fr/hal-00308119/en/ %D 2004