Pages that link to "Item:Q360271"
From MaRDI portal
The following pages link to Distributed minimum dominating set approximations in restricted families of graphs (Q360271):
Displaying 20 items.
- Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs (Q501664) (← 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 distance domination in graphs with no \(K_{2,t}\)-minor (Q2143127) (← 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)
- Property testing of planarity in the \textsf{CONGEST} model (Q2657275) (← links)
- Distributed Dominating Set Approximations beyond Planar Graphs (Q4972685) (← links)
- Fast Distributed Approximation for Max-Cut (Q5056049) (← links)
- Distributed Approximation Algorithms for the Minimum Dominating Set in K_h-Minor-Free Graphs (Q5091012) (← links)
- Distributed distance-\(r\) covering problems on sparse high-girth graphs (Q5918492) (← links)
- Distributed distance-\(r\) covering problems on sparse high-girth graphs (Q5925671) (← links)
- The energy complexity of diameter and minimum cut computation in bounded-genus networks (Q6148068) (← links)
- The energy complexity of diameter and minimum cut computation in bounded-genus networks (Q6199403) (← links)
- The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs (Q6202219) (← links)
- Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications (Q6202221) (← links)