2000 character limit reached
Constant round distributed domination on graph classes with bounded expansion (2012.02701v3)
Published 4 Dec 2020 in cs.DS, cs.DC, and cs.DM
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.