A distributed algorithm for k-dominating sets
From MaRDI portal
A distributed algorithm for \(k\)-dominating sets
Recommendations
- A distributed algorithm to find \(k\)-dominating sets
- Fast Distributed Construction of Smallk-Dominating Sets and Applications
- scientific article; zbMATH DE number 2019630
- An efficient distributed algorithm for constructing small dominating sets
- A distributed algorithm for minimum distance-k domination in trees
Cites work
Cited in
(13)- An efficient distributed algorithm for canonical labeling on directed split-stars
- Distributed algorithms for finding the unique minimum distance dominating set in directed split-stars.
- Deterministic distributed construction of T-dominating sets in time T
- A distributed algorithm to find \(k\)-dominating sets
- A log-star distributed maximal independent set algorithm for growth-bounded graphs
- Fast Distributed Construction of Smallk-Dominating Sets and Applications
- scientific article; zbMATH DE number 708868 (Why is no real title available?)
- scientific article; zbMATH DE number 2044937 (Why is no real title available?)
- Distributed Dominating Set Approximations beyond Planar Graphs
- Probabilistic algorithm for minimum \(k\)-fold dominating set problem
- An efficient distributed algorithm for constructing small dominating sets
- A distributed algorithm for minimum distance-k domination in trees
- Distributed approximation of capacitated dominating sets
This page was built for publication: A distributed algorithm for \(k\)-dominating sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2741487)