Pages that link to "Item:Q5361940"
From MaRDI portal
The following pages link to A Local Constant Factor MDS Approximation for Bounded Genus Graphs (Q5361940):
Displaying 11 items.
- Distributed \(\mathcal{CONGEST}_{B C}\) constant approximation of MDS in bounded genus graphs (Q1711828) (← 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)
- Property testing of planarity in the \textsf{CONGEST} model (Q2657275) (← links)
- Distributed Dominating Set Approximations beyond Planar Graphs (Q4972685) (← 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)
- The energy complexity of diameter and minimum cut computation in bounded-genus networks (Q6199403) (← links)
- Distributed domination on sparse graph classes (Q6614403) (← links)
