Near-Optimal Distributed Dominating Set in Bounded Arboricity Graphs-Reference-Cited by-同舟云学术

Near-Optimal Distributed Dominating Set in Bounded Arboricity Graphs

Published:2022-07-20 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing
language:
Short-container-title:

Author:

Dory Michal¹,Ghaffari Mohsen¹,Ilchi Saeed¹

Affiliation:

1. ETH Zurich, Zurich, Switzerland

Funder

European Research Council

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3519270.3538437

Reference26 articles.

1. Distributed Domination on Graph Classes of Bounded Expansion

2. Saeed Akhoondian Amiri . 2021. Deterministic CONGEST Algorithm for MDS on Bounded Arboricity Graphs. CoRR abs/2102.08076 ( 2021 ). Saeed Akhoondian Amiri. 2021. Deterministic CONGEST Algorithm for MDS on Bounded Arboricity Graphs. CoRR abs/2102.08076 (2021).

3. Distributed Dominating Set Approximations beyond Planar Graphs

4. Tight approximation bounds for dominating set on graphs of bounded arboricity

5. Marthe Bonamy , Linda Cook , Carla Groenland , and Alexandra Wesolek . 2021 . A Tight Local Algorithm for the Minimum Dominating Set Problem in Outerplanar Graphs . In 35th International Symposium on Distributed Computing, DISC 2021 (LIPIcs , Vol. 209). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 13:1--13: 18 . Marthe Bonamy, Linda Cook, Carla Groenland, and Alexandra Wesolek. 2021. A Tight Local Algorithm for the Minimum Dominating Set Problem in Outerplanar Graphs. In 35th International Symposium on Distributed Computing, DISC 2021 (LIPIcs, Vol. 209). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 13:1--13:18.

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Distributed domination on sparse graph classes;European Journal of Combinatorics;2023-08