23 citations · 150 across the 51 of their papers we have counts for
Showing cs.DCShow all
2 papers · 1 filter
cs.DC2021
A tight local algorithm for the minimum dominating set problem in outerplanar graphs
Marthe Bonamy, Linda Cook, Carla Groenland +1
We show that there is a deterministic local algorithm (constant-time distributed graph algorithm) that finds a 5-approximation of a minimum dominating set on outerplanar graphs. We…
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…