Local planar domination revisited
From MaRDI portal
Publication:2097345
DOI10.1007/978-3-031-09993-9_9OpenAlexW3215175533MaRDI QIDQ2097345FDOQ2097345
Authors: Ozan Heydt, Sebastian Siebertz, Alexandre Vigny 
Publication date: 11 November 2022
Full work available at URL: https://arxiv.org/abs/2111.14506
Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx) Communication complexity, information complexity (68Q11)
Cites Work
- Reducibility among combinatorial problems
- On the degrees of the vertices of a directed graph
- Sparsity. Graphs, structures, and algorithms
- Kernelization using structural parameters on sparse graph classes
- On the maximum number of cliques in a graph
- Local computation: lower and upper bounds
- Distributed minimum dominating set approximations in restricted families of graphs
- Distributed Dominating Set Approximations beyond Planar Graphs
- A strengthened analysis of a local algorithm for the minimum dominating set problem in planar graphs
- Survey of local algorithms
- Connected dominating set. Theory and applications
- Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs
- The price of being near-sighted
- Tight approximation bounds for dominating set on graphs of bounded arboricity
- Greedy domination on biclique-free graphs
- Constant round distributed domination on graph classes with bounded expansion
- On distance \(r\)-dominating and \(2r\)-independent sets in sparse graphs
Cited In (1)
This page was built for publication: Local planar domination revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2097345)
