Pages that link to "Item:Q748117"
From MaRDI portal
The following pages link to A local approximation algorithm for minimum dominating set problem in anonymous planar networks (Q748117):
Displayed 4 items.
- Distributed \(\mathcal{CONGEST}_{B C}\) constant approximation of MDS in bounded genus graphs (Q1711828) (← links)
- Invulnerability of planar two-tree networks (Q1733045) (← links)
- Local certification of graphs with bounded genus (Q2104916) (← links)
- Distributed approximation algorithms for \(k\)-dominating set in graphs of bounded genus and linklessly embeddable graphs (Q2290639) (← links)