VNU-UET Repository

Solving the k-dominating set problem on very large-scale networks

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).

[img] HTML - Published Version
Download (215kB)


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

Item Type: Article
Subjects: Information Technology (IT)
Scopus-indexed journals
ISI-indexed journals
Divisions: Faculty of Information Technology (FIT)
Depositing User: Hà Minh Hoàng
Date Deposited: 14 Sep 2020 02:52
Last Modified: 14 Sep 2020 02:52

Actions (login required)

View Item View Item