English

Deterministic CONGEST Algorithm for MDS on Bounded Arboricity Graphs

Data Structures and Algorithms 2021-02-23 v2 Distributed, Parallel, and Cluster Computing

Abstract

We provide a deterministic CONGEST algorithm to constant factor approximate the minimum dominating set on graphs of bounded arboricity in O(logn)O(\log n) rounds. This improves over the well-known randomized algorithm of Lenzen and Wattenhofer[DISC2010] by making it a deterministic algorithm.

Keywords

Cite

@article{arxiv.2102.08076,
  title  = {Deterministic CONGEST Algorithm for MDS on Bounded Arboricity Graphs},
  author = {Saeed Akhoondian Amiri},
  journal= {arXiv preprint arXiv:2102.08076},
  year   = {2021}
}