Deterministic distributed construction of T-dominating sets in time T
Discrete Applied Mathematics, Volume 222, Issue C, 2017, Pages 172-178.
T-dominating set LOCAL modelDistributed algorithmUndirected network
A k-dominating set is a set D of nodes of a graph such that, for each node v, there exists a node wD at distance at most k from v. Our aim is the deterministic distributed construction of small T-dominating sets in time T in networks modelled as undirected n-node graphs and under the LOCAL communication model.For any positive integer T, i...More
Full Text (Upload PDF)
PPT (Upload PPT)