Pages that link to "Item:Q2290639"
From MaRDI portal
The following pages link to Distributed approximation algorithms for \(k\)-dominating set in graphs of bounded genus and linklessly embeddable graphs (Q2290639):
Displaying 5 items.
- Distributed minimum dominating set approximations in restricted families of graphs (Q360271) (← links)
- Distributed \(\mathcal{CONGEST}_{B C}\) constant approximation of MDS in bounded genus graphs (Q1711828) (← links)
- Constant-factor approximation of the domination number in sparse graphs (Q1943391) (← links)
- Distributed distance domination in graphs with no \(K_{2,t}\)-minor (Q2143127) (← links)
- Domination and convexity problems in the target set selection model (Q2689641) (← links)