12. Kempe, D., J. Kleinberg and E.V. Tardos. Maximizing the spread of influence through a social network.
2003.
13. 冀进朝, 韩笑, 王喆, 基于完全级联传播模型的社区影响最大化. 吉林大学学报: 理学版, 2009.
47(005): p. 1032--1034.
14. Even-Dar, E. and A. Shapira, A note on maximizing the spread of influence in social networks. Internet
and Network Economics, 2007: p. 281--286.
15. 汪小帆, 李翔, 陈关荣, 复杂网络理论及其应用. 2006: 清华大学出版社有限公司. 16. Leskovec, J., et al. Cost-effective outbreak detection in networks. 2007.
17. Chen, W., Y. Wang and S. Yang. Efficient influence maximization in social networks. 2009. 18. 兰如钦, 社会网络上的影响力最大化算法研究. 2011, 北京交通大学.
19. Estevez, P.A., P. Vera and K. Saito. Selecting the most influential nodes in social networks. 2007. 20. 景天魁, 林聚任, 社会网络分析: 理论, 方法与应用. 2009, 北京: 北京师范大学出版社.
21. Galstyan, A., V. Musoyan and P. Cohen, Maximizing influence propagation in networks with community
structure. Physical Review E, 2009. 79(5): p. 056102.
22. Cao, T., et al. OASNET: an optimal allocation approach to influence maximization in modular social
networks. 2010.
23. Clauset, A., M.E. Newman and C. Moore, Finding community structure in very large networks. Physical
review E, 2004. 70(6): p. 066111.
24. Wang, Y., et al. Community-based greedy algorithm for mining top-k influential nodes in mobile social
networks. 2010.
25. Mathioudakis, M., et al. Sparsification of influence networks. 2011.
26. Gomez-Rodriguez, M., J. Leskovec and A. Krause, Inferring networks of diffusion and influence. ACM
Transactions on Knowledge Discovery from Data (TKDD), 2012. 5(4): p. 21.
27. Suri, N.R. and Y. Narahari. Determining the top-k nodes in social networks using the shapley value. 2008. 28. Narayanam, R. and Y. Narahari, A shapley value-based approach to discover influential nodes in social
networks. IEEE Transactions on Automation Science and Engineering, 2010(99): p. 1--18.
29. Kimura, M., K. Saito and R. Nakano. Extracting influential nodes for information diffusion on a social
network. 2007.