A distributed algorithm to find k-dominating sets

L. D. Penso, V. C. Barbosa

We consider a connected undirected graph $G(n,m)$ with $n$ nodes and $m$ edges. A $k$-dominating set $D$ in $G$ is a set of nodes having the property that every node in $G$ is at m…