eprintid: 3673
rev_number: 9
eprint_status: archive
userid: 365
dir: disk0/00/00/36/73
datestamp: 2019-11-29 03:37:33
lastmod: 2019-11-29 05:53:49
status_changed: 2019-11-29 03:37:33
type: conference_item
metadata_visibility: show
creators_name: Nguyen, Minh Hai
creators_name: Ha, Minh Hoang
creators_name: Dinh, Thai Hoang
creators_name: Diep, Nguyen
creators_name: Dutkiewicz, Eryk
creators_name: Tran, The Trung
creators_id: minhhoang.ha@vnu.edu.vn
title: An Efficient Algorithm for the k-Dominating Set Problem on Very Large-Scale Networks
ispublished: pub
subjects: IT
divisions: fac_fit
abstract: 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.
date: 2019
date_type: published
full_text_status: public
pres_type: paper
event_title: CSoNet 2019
event_location: Ho Chi Minh
event_type: conference
refereed: TRUE
citation:   Nguyen, Minh Hai and Ha, Minh Hoang and Dinh, Thai Hoang and Diep, Nguyen and Dutkiewicz, Eryk and Tran, The Trung  (2019) An Efficient Algorithm for the k-Dominating Set Problem on Very Large-Scale Networks.  In: CSoNet 2019, Ho Chi Minh.     
document_url: https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3673/1/_k__Dominating_Set_Problem_on_massive_graphs.pdf