Local planar domination revisited
type: Item
instance of: scholarly article
title: Local planar domination revisited
DOI: 10.1007/978-3-031-09993-9_9
author: Ozan Heydt
author: Sebastian Siebertz
author: Alexandre Vigny
publication date: 2022-11-11T00:00:00Z
full work available at URL: https://arxiv.org/abs/2111.14506
Mathematics Subject Classification ID: 68Mxx
Mathematics Subject Classification ID: 68Q11
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 7615856
zbMATH Keywords: dominating set
zbMATH Keywords: LOCAL algorithms
zbMATH Keywords: planar graphs
MaRDI profile type: Publication
OpenAlex ID: W3215175533
cites work: Distributed Dominating Set Approximations beyond Planar Graphs
cites work: Tight approximation bounds for dominating set on graphs of bounded arboricity
cites work: Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs
cites work: Connected dominating set. Theory and applications
cites work: On distance ‐dominating and ‐independent sets in sparse graphs
cites work: Kernelization using structural parameters on sparse graph classes
cites work: On the degrees of the vertices of a directed graph
cites work: Reducibility among Combinatorial Problems
cites work: Constant round distributed domination on graph classes with bounded expansion
cites work: The price of being near-sighted
cites work: Local Computation
cites work: Distributed minimum dominating set approximations in restricted families of graphs
cites work: Sparsity. Graphs, structures, and algorithms
cites work: Greedy domination on biclique-free graphs
cites work: Survey of local algorithms
cites work: A strengthened analysis of a local algorithm for the minimum dominating set problem in planar graphs
cites work: On the maximum number of cliques in a graph
description: scientific article; zbMATH DE number 7615856