On constructing strongly connected dominating and absorbing set in 3-dimensional wireless ad hoc networks
From MaRDI portal
Publication:2658460
DOI10.1155/2020/9189645zbMath1506.68080OpenAlexW3008238152MaRDI QIDQ2658460
Publication date: 22 March 2021
Published in: Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2020/9189645
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distributed systems (68M14)
Cites Work
- Approximation for minimum strongly connected dominating and absorbing set with routing-cost constraint in disk digraphs
- On connected domination in unit ball graphs
- Minimum connected dominating sets and maximal independent sets in unit disk graphs
- A better approximation for constructing virtual backbone in 3D wireless ad-hoc networks
- Construction of strongly connected dominating sets in asymmetric multihop wireless networks
- Approximation algorithms for connected dominating sets
This page was built for publication: On constructing strongly connected dominating and absorbing set in 3-dimensional wireless ad hoc networks
