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…