The complexity of influence maximization problem in the deterministic linear threshold model
From MaRDI portal
Publication:1928515
DOI10.1007/s10878-011-9393-3zbMath1261.91041OpenAlexW1995323604MaRDI QIDQ1928515
Wei Zhang, Bin Fu, Zaixin Lu, Weili Wu, Joon-Mo Kim
Publication date: 3 January 2013
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-011-9393-3
Related Items (6)
Dynamic model of information diffusion based on multidimensional complex network space and social game ⋮ On the shoulders of giants: incremental influence maximization in evolving social networks ⋮ An exact method for influence maximization based on deterministic linear threshold model ⋮ The fashion game: network extension of matching pennies ⋮ Optimizing spread dynamics on graphs by message passing ⋮ Algorithms for influence maximization in socio-physical networks
Cites Work
This page was built for publication: The complexity of influence maximization problem in the deterministic linear threshold model
