scientific article; zbMATH DE number 2079403
From MaRDI portal
Publication:4471362
Recommendations
- Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
- An efficient distributed algorithm for constructing small dominating sets
- Approximation algorithms for connected dominating sets
- Fast Distributed Construction of Smallk-Dominating Sets and Applications
- Distributed routing algorithms for multi-hop ad hoc networks using \(d\)-hop connected \(d\)-dominating sets
Cited in
(12)- Connected domination of regular graphs
- Revisiting connected dominating sets: an almost optimal local information algorithm
- Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
- Constructing weakly connected dominating set for secure clustering in distributed sensor network
- High Performance Computing - HiPC 2003
- Analyzing the optimal neighborhood: algorithms for partial and budgeted connected dominating set problems
- Approximation algorithms for channel allocation problems in broadcast networks
- Distributed algorithms for ultrasparse spanners and linear size skeletons
- Constant-time distributed dominating set approximation
- Residue domination in bounded-treewidth graphs
- Bounds relating the weakly connected domination number to the total domination number and the matching number
- A self-stabilizing algorithm for constructing weakly connected minimal dominating sets
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4471362)
