Constant round distributed domination on graph classes with bounded expansion

12/04/2020

∙

by   Simeon Kublenz, et al.

∙

0

∙

share

We show that the dominating set problem admits a constant factor approximation in a constant number of rounds in the LOCAL model of distributed computing on graph classes with bounded expansion. This generalizes a result of Czygrinow et al. for graphs with excluded topological minors.