Pages that link to "Item:Q4972685"
From MaRDI portal
The following pages link to Distributed Dominating Set Approximations beyond Planar Graphs (Q4972685):
Displaying 14 items.
- Distributed minimum dominating set approximations in restricted families of graphs (Q360271) (← links)
- Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs (Q501664) (← links)
- Distributed approximation of capacitated dominating sets (Q613113) (← links)
- A local approximation algorithm for minimum dominating set problem in anonymous planar networks (Q748117) (← links)
- Distributed \(\mathcal{CONGEST}_{B C}\) constant approximation of MDS in bounded genus graphs (Q1711828) (← links)
- Compact distributed certification of planar graphs (Q2037111) (← links)
- Local planar domination revisited (Q2097345) (← links)
- Local certification of graphs with bounded genus (Q2104916) (← links)
- Constant round distributed domination on graph classes with bounded expansion (Q2117740) (← links)
- Distributed approximation algorithms for \(k\)-dominating set in graphs of bounded genus and linklessly embeddable graphs (Q2290639) (← links)
- A strengthened analysis of a local algorithm for the minimum dominating set problem in planar graphs (Q2445394) (← links)
- Near-optimal distributed DFS in planar graphs (Q6487493) (← links)
- Distributed domination on sparse graph classes (Q6614403) (← links)
- Near-optimal distributed dominating set in bounded arboricity graphs (Q6658821) (← links)
