Pages that link to "Item:Q1827867"
From MaRDI portal
The following pages link to A distributed algorithm to find \(k\)-dominating sets (Q1827867):
Displaying 8 items.
- Distributed approximation of capacitated dominating sets (Q613113) (← links)
- Fast deterministic distributed algorithms for sparse spanners (Q930906) (← links)
- An efficient distributed algorithm for canonical labeling on directed split-stars (Q1003736) (← links)
- Distributed algorithms for finding the unique minimum distance dominating set in directed split-stars. (Q1398783) (← links)
- Distributed approximation algorithms for \(k\)-dominating set in graphs of bounded genus and linklessly embeddable graphs (Q2290639) (← links)
- A distributed algorithm for \(k\)-dominating sets (Q2741487) (← links)
- Fast Distributed Construction of Smallk-Dominating Sets and Applications (Q4216145) (← links)
- Constant-time distributed dominating set approximation (Q5917933) (← links)