%0 Conference Paper
%A Nguyen, Minh Hai
%A Ha, Minh Hoang
%A Dinh, Thai Hoang
%A Diep, Nguyen
%A Dutkiewicz, Eryk
%A Tran, The Trung
%B CSoNet 2019
%C Ho Chi Minh
%D 2019
%F SisLab:3673
%T An Efficient Algorithm for the k-Dominating Set Problem on Very Large-Scale Networks
%U https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3673/
%X The minimum dominating set problem (MDSP) aims to construct the minimum-size subset   D⊂V  of a graph   G=(V,E)  such that every vertex has at least one neighbor in D. The problem is proved to be NP-hard [5]. In a recent industrial application, we encountered a more general variant of MDSP that extends the neighborhood relationship as follows: a vertex is a k-neighbor of another if there exists a linking path through no more than k edges between them. This problem is called the minimum k-dominating set problem (MkDSP) and the dominating set is denoted as D_k. The MkDSP can be used to model applications in social networks [2] and design of wireless sensor networks [3]. In our case, a telecommunication company uses the problem model to supervise a large social network up to 17 millions nodes via a dominating subset in which k is set to 3.