The concept of a dominating set occupies a central place in graph-theoretic approaches to social network analysis. A dominating set is a subset of actors such that every individual outside this set ...
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 ...
Abstract: The minimum dominating set (MDS) of the network is a node subset of smallest size that every node in the network is either in this subset or is adjacent to one or more nodes of this subset.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results