Abstract: Weighted vertex cover (WVC) problem, as one of the most important combinatorial optimization problems, is a general form of the classic vertex cover problem. The existing researches focused ...
Abstract: Identifying positive influence dominating set (PIDS) with the smallest cardinality can produce positive effect with the minimal cost on a social network. The purpose of this article is to ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results