Influence Maximization with Priority in Online Social Networks

The Influence Maximization (IM) problem, which finds a set of k nodes (called seedset) in a social network to initiate the influence spread so that the number of influenced nodes after propagation process is maximized, is an important problem in information propagation and social network analysis. H...

Full description

Bibliographic Details

Published in:	Algorithms Vol. 13; no. 8; p. 183
Main Authors:	Pham, Canh V., Ha, Dung K. T., Vu, Quang C., Su, Anh N., Hoang, Huan X.
Format:	Journal Article
Language:	English
Published:	Basel MDPI AG 01.08.2020
Subjects:	Algorithms Approximation approximation algorithm Competition Greedy algorithms Influence influence maximization with priority Information dissemination Maximization Network analysis Nodes Optimization Sampling methods Social networks Viral marketing
ISSN:	1999-4893, 1999-4893
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!