Deterministic Distributed Dominating Set Approximation in the CONGEST Model
From MaRDI portal
Publication:5145186
DOI10.1145/3293611.3331626OpenAlexW2963158951WikidataQ130877453 ScholiaQ130877453MaRDI QIDQ5145186
Janosch Deurer, Yannic Maus, Fabian Kuhn
Publication date: 20 January 2021
Published in: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.10775
Related Items (6)
Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph ⋮ Network Decomposition and Distributed Derandomization (Invited Paper) ⋮ Deterministic Massively Parallel Connectivity ⋮ Distributed Symmetry Breaking on Power Graphs via Sparsification ⋮ Distributed distance-\(r\) covering problems on sparse high-girth graphs ⋮ Distributed distance-\(r\) covering problems on sparse high-girth graphs
This page was built for publication: Deterministic Distributed Dominating Set Approximation in the CONGEST Model
