paper

Constant round distributed domination on graph classes with bounded expansion

arXiv:2012.02701

Abstract

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.

Paper accepted at SIROCCO 2021, implemented reviews, corrected an error in Lemma 1

Constant round distributed domination on graph classes with bounded expansion · wovepaper