Constant round distributed domination on graph classes with bounded expansion

Simeon Kublenz, Sebastian Siebertz, Alexandre Vigny

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.

Knowledge Graph

arrow_drop_up

Comments

Sign up or login to leave a comment