Abstract: The problem of finding a minimum-weight connected dominating set (CDS) of a given undirected graph has been studied actively, motivated by operations of wireless ad hoc networks. In this ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results