Abstract: A k-hop dominating set is a subset of nodes such that each node that is not in the set can be reached within k hops from at least one node in the set. A connected k-hop dominating set can be ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback