Deterministic CONGEST Algorithm for MDS on Bounded Arboricity Graphs

02/16/2021
by   Saeed Akhoondian Amiri, et al.
0

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

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/10/2022

Near-Optimal Distributed Dominating Set in Bounded Arboricity Graphs

We describe a simple deterministic O( ε^-1logΔ) round distributed algori...
research
05/26/2019

Deterministic Distributed Dominating Set Approximation in the CONGEST Model

We develop deterministic approximation algorithms for the minimum domina...
research
08/05/2021

A tight local algorithm for the minimum dominating set problem in outerplanar graphs

We show that there is a deterministic local algorithm (constant-time dis...
research
07/06/2022

Distributed domination on sparse graph classes

We show that the dominating set problem admits a constant factor approxi...
research
10/07/2019

Distributed Distance-r Dominating Set on Sparse High-Girth Graphs

The dominating set problem and its generalization, the distance-r domina...
research
03/07/2022

Distributed distance domination in graphs with no K_2,t-minor

We prove that a simple distributed algorithm finds a constant approximat...
research
05/18/2022

Deterministic Near-Optimal Distributed Listing of Cliques

The importance of classifying connections in large graphs has been the m...

Please sign up or login with your details

Forgot password? Click here to reset