eprintid: 4060
rev_number: 14
eprint_status: archive
userid: 365
dir: disk0/00/00/40/60
datestamp: 2020-09-14 02:52:10
lastmod: 2020-09-14 02:52:41
status_changed: 2020-09-14 02:52:10
type: article
metadata_visibility: show
creators_name: Nguyen, Minh Hai
creators_name: Ha, Minh Hoang
creators_name: Nguyen N, Diep
creators_name: Tran, The Trung
creators_id: minhhoang.ha@vnu.edu.vn
creators_id: Diep.Nguyen@uts.edu.au
creators_id: trung@fpt.edu.vn
title: Solving the k-dominating set problem on very large-scale networks
ispublished: pub
subjects: IT
subjects: Scopus
subjects: isi
divisions: fac_fit
abstract: The well-known minimum dominating set problem (MDSP) aims to construct the minimum-size subset of vertices in a graph such that every other vertex has at least one neighbor in the subset. In this article, we study a general version of the problem that extends the neighborhood relationship: two vertices are called neighbors of each other if there exists a path through no more than k edges between them. The problem called “minimum k-dominating set problem” (MkDSP) becomes the classical dominating set problem if k is 1 and has important applications in monitoring large-scale social networks. We propose an efficient heuristic algorithm that can handle real-world instances with up to 17 million vertices and 33 million edges. This is the first time such large graphs are solved for the minimum k-dominating set problem
date: 2020
date_type: published
publisher: Springer
full_text_status: public
publication: Computational Social Networks
number: 7
refereed: TRUE
citation:   Nguyen, Minh Hai and Ha, Minh Hoang and Nguyen N, Diep and Tran, The Trung  (2020) Solving the k-dominating set problem on very large-scale networks.  Computational Social Networks  (7).        
document_url: https://eprints.uet.vnu.edu.vn/eprints/id/eprint/4060/1/10.1186/s40649-020-00078-5