2 citations · 4 across the 13 of their papers we have counts for
Showing 2018 · cs.DCShow all
3 papers · 2 filters
cs.DC2018
The distributed complexity of locally checkable problems on paths is decidable
Alkida Balliu, Sebastian Brandt, Yi-Jun Chang +3
Consider a computer network that consists of a path with nodes. The nodes are labeled with inputs from a constant-sized set, and the task is to find output labels from a consta…
cs.DC2018
Distributed Reconfiguration of Maximal Independent Sets
Keren Censor-Hillel, Mikaël Rabie
In this paper, we investigate a distributed maximal independent set (MIS) reconfiguration problem, in which there are two maximal independent sets for which every node is given its…
cs.DC2018
Distributed Recoloring
Marthe Bonamy, Paul Ouvrard, Mikaël Rabie +2
Given two colorings of a graph, we consider the following problem: can we recolor the graph from one coloring to the other through a series of elementary changes, such that the gra…