…
comment: The repository administrator has not yet configured an RDF license.
primary topic: Solving the k-dominating set problem on very large-scale networks

Solving the k-dominating set problem on very large-scale networks
type: AcademicArticle
type: Article
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
issue: 7
status: peerReviewed
status: published
author list: authors
type: EPrint
type: ArticleEPrint
is part of: repository
has document: Solving the k-dominating set problem on very large-scale networks (HTML)
has version: Solving the k-dominating set problem on very large-scale networks (HTML)
has published: Solving the k-dominating set problem on very large-scale networks (HTML)
subject: Information Technology (IT)
subject: Scopus-indexed journals
subject: ISI-indexed journals

Solving the k-dominating set problem on very large-scale networks (HTML)
type: Document
has file: 10.1186/s40649-020-00078-5
has part: 10.1186/s40649-020-00078-5

Springer
type: Organization

Computational Social Networks
type: Collection

Minh Hai Nguyen
type: Person
given name: Minh Hai
family name: Nguyen

The Trung Tran
type: Person
given name: The Trung
family name: Tran

Diep Nguyen N
type: Person
given name: Diep
family name: Nguyen N

Minh Hoang Ha
type: Person
given name: Minh Hoang
family name: Ha

HTML Summary of #4060 Solving the k-dominating set problem on very large-scale networks
format: text/html
primary topic: Solving the k-dominating set problem on very large-scale networks

Information Technology (IT)
type: Concept

Scopus-indexed journals
type: Concept

ISI-indexed journals
type: Concept