2 citations · 4 across the 13 of their papers we have counts for
3 papers · 1 filter
Making Self-Stabilizing any Locally Greedy Problem
Johanne Cohen, Laurence Pilard, Mikaël Rabie +1
We propose a way to transform synchronous distributed algorithms solving locally greedy and mendable problems into self-stabilizing algorithms in anonymous networks. Mendable probl…
Fault Tolerant Coloring of the Asynchronous Cycle
Pierre Fraigniaud, Patrick Lambein-Monette, Mikaël Rabie
We present a wait-free algorithm for proper coloring the n nodes of the asynchronous cycle , where each crash-prone node starts with its (unique) identifier as input. The algo…
Short and local transformations between ()-colorings
Nicolas Bousquet, Laurent Feuilloley, Marc Heinrich +1
Recoloring a graph is about finding a sequence of proper colorings of this graph from an initial coloring to a target coloring . Adding the constraint that each pair of cons…