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

v1v2 (latest)

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

5 August 2021

Alexandra Wesolek

ArXiv (abs)PDF HTML

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

10 / 10 papers shown

Title
Tight Bounds for Constant-Round Domination on Graphs of High Girth and Low Expansion Christoph Lenzen Sophie Wenning 46 0 0 23 Aug 2024
The Distributed Complexity of Locally Checkable Labeling Problems Beyond Paths and Trees Yi-Jun Chang 76 2 0 12 Nov 2023
Fully Scalable Massively Parallel Algorithms for Embedded Planar Graphs Yi-Jun Chang Danling Zheng 84 1 0 15 Apr 2023
Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications Yi-Jun Chang 48 5 0 10 Apr 2023
Distributed domination on sparse graph classes O. Heydt Simeon Kublenz P. D. Mendez S. Siebertz Alexandre Vigny GNN 60 2 0 06 Jul 2022
Near-Optimal Distributed Dominating Set in Bounded Arboricity Graphs Michal Dory M. Ghaffari S. Ilchi 56 7 0 10 Jun 2022
$Narrowing the LOCAL$\unicode{x2013}$CONGEST Gaps in Sparse Networks via Expander Decompositions$ Narrowing the LOCAL $\unicode{x2013}$ CONGEST Gaps in Sparse Networks via Expander Decompositions Yi-Jun Chang Hsin-Hao Su 102 10 0 17 May 2022
$Distributed distance domination in graphs with no $K_{2,t}$-minor$ Distributed distance domination in graphs with no $K_{2,t}$ -minor A. Czygrinow Michal Hanćkowiak Marcin Witkowski 50 1 0 07 Mar 2022
Local planar domination revisited O. Heydt S. Siebertz Alexandre Vigny 69 5 0 29 Nov 2021
Bibliography of distributed approximation beyond bounded degree Laurent Feuilloley 81 3 0 22 Jan 2020