relation: https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3435/
title: Maximizing misinformation restriction within time and budget constraints
creator: Pham, Canh V.
creator: Thai, My T.
creator: Duong, Hieu V.
creator: Bui, Bao Q.
creator: Hoang, Xuan Huan
subject: Scopus-indexed journals
subject: ISI-indexed journals
description: Online social networks have become popular media worldwide. However,they also allow rapid dissemination of misinformation causing negative impacts tousers. With a source of misinformation, the longer the misinformation spreads, thegreater the number of affected users will be. Therefore, it is necessary to preventthe spread of misinformation in a specific time period. In this paper, we proposemaximizing misinformation restriction (MMR) problem with the purpose of finding aset of nodes whose removal from a social network maximizes the influence reductionfrom the source of misinformation within time and budget constraints. We demonstratethat theMMRproblem is NP-hard even in the case where the network is a rooted tree
date: 2018-02
type: Article
type: PeerReviewed
identifier:   Pham, Canh V. and Thai, My T. and Duong, Hieu V. and Bui, Bao Q. and Hoang, Xuan Huan  (2018) Maximizing misinformation restriction within time and budget constraints.  Journal of Combinatorial Optimization, 35  (4).   pp. 1202-1240.  ISSN 1382-6905     
relation: http://doi.org/10.1007/s10878-018-0252-3
relation: doi:10.1007/s10878-018-0252-3