Deterministic Distributed Dominating Set Approximation in the CONGEST
Model

v1v2 (latest)

Deterministic Distributed Dominating Set Approximation in the CONGEST Model

26 May 2019

ArXiv (abs)PDF HTML

Papers citing "Deterministic Distributed Dominating Set Approximation in the CONGEST Model"

10 / 10 papers shown

Title
Distributed Symmetry Breaking on Power Graphs via Sparsification Yannic Maus Saku Peltonen Jara Uitto 52 11 0 14 Feb 2023
Near-Optimal Distributed Dominating Set in Bounded Arboricity Graphs Michal Dory M. Ghaffari S. Ilchi 51 6 0 10 Jun 2022
Deterministic Massively Parallel Connectivity Samantha R. Coy A. Czumaj 68 18 0 09 Aug 2021
Efficient CONGEST Algorithms for the Lovasz Local Lemma Yannic Maus Jara Uitto 50 10 0 05 Aug 2021
Coloring Fast Without Learning Your Neighbors' Colors Magnús M. Halldórsson Fabian Kuhn Yannic Maus Alexandre Nolin 52 10 0 10 Aug 2020
Distance-2 Coloring in the CONGEST Model Magnús M. Halldórsson Fabian Kuhn Yannic Maus 46 15 0 13 May 2020
Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space A. Czumaj Peter Davies M. Parter 64 29 0 11 Dec 2019
Distributed Distance- $r$ Dominating Set on Sparse High-Girth Graphs S. A. Amiri Ben Wiederhake 15 0 0 07 Oct 2019
Improved Network Decompositions using Small Messages with Applications on MIS, Neighborhood Covers, and Beyond M. Ghaffari Julian Portmann 28 14 0 09 Aug 2019
Polylogarithmic-Time Deterministic Network Decomposition and Distributed Derandomization Václav Rozhon M. Ghaffari OOD 44 196 0 25 Jul 2019