supported by the doctoral startup fund of Xinjiang University of China (grant number 208-61357);the National Natural Science Foundation of China (grant number 11 465 019,11 664 040)。
The directed L-distance minimal dominating set(MDS) problem has wide practical applications in the fields of computer science and communication networks. Here, we study this problem from the perspective of purely theo...
Supported by the Doctoral Startup Fund of Xinjiang University of China under Grant No.208-61357;the National Natural Science Foundation of China under Grant No.11765021
The minimal dominating set for a digraph(directed graph) is a prototypical hard combinatorial optimization problem. In a previous paper, we studied this problem using the cavity method. Although we found a solution fo...