Mining the network value of customers
Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
Dynamic monopolies of constant size
Journal of Combinatorial Theory Series B
Mining knowledge-sharing sites for viral marketing
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Maximizing the spread of influence through a social network
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Structural and algorithmic aspects of massive social networks
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Information diffusion through blogspace
Proceedings of the 13th international conference on World Wide Web
Inoculation strategies for victims of viruses and the sum-of-squares partition problem
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On the spread of viruses on the internet
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Positive Influence Dominating Set in Online Social Networks
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Extracting influential nodes for information diffusion on a social network
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Design and Analysis of Approximation Algorithms
Design and Analysis of Approximation Algorithms
New dominating sets in social networks
Journal of Global Optimization
Robust optimization of graph partitioning and critical node detection in analyzing networks
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
Journal of Combinatorial Optimization
Cheap, easy, and massively effective viral marketing in social networks: truth or fiction?
Proceedings of the 23rd ACM conference on Hypertext and social media
The complexity of influence maximization problem in the deterministic linear threshold model
Journal of Combinatorial Optimization
Time-bounded essential localization for wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
On the approximability of positive influence dominating set in social networks
Journal of Combinatorial Optimization
| Hi-index | 0.00 |
As one of the essential problems in information diffusion process, how to select a set of influential nodes as the starting nodes has been studied by lots of researchers. All the existing solutions focus on how to maximize the influence of the initially selected "influential nodes", paying no attention on how the influential nodes selection could maximize the speed of the diffusion. In this paper, we consider the problem of influential nodes selection regarding to the propagation speed in social network information diffusion. We define a discrete optimization problem, called Fast Information Propagation Problem . We show that this problem is NP-hard problem when the time requirement for information propagation is exactly 1-hop. We also propose a Latency-bounded Minimum Influential Node Selection Algorithm to solve the problem in this case.