Author:
Kim Donghyun,Li Deying,Asgari Omid,Li Yingshu,Tokuta Alade O.,Oh Heekuck
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference11 articles.
1. Dinh TN, Shen Y, Nguyen DT, Thai MT (2012) On the approximability of positive influence dominating set in social networks. J Comb Optim. doi: 10.1007/s10878-012-9530-7
2. Eubank S, Anil Kumar VS, Marathe MV, Srinivasan A, Wang N (2004) Structural and algorithmic aspects of massive social networks. In: Proceedings of the 15th ACM-SIAM symposium on discrete algorithms (SODA), p 718–727, 2004
3. Garey MR, Johnson DS (1978) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco
4. Guha S, Khuller S (1996) Approximation algorithms for connected dominating sets. Algorithmica 20:374–387
5. Kelleher LL, Cozzens MB (1988) Dominating sets in social network graphs. Math Soc Sci 16(3):267–279
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. An Efficient Social Event Invitation Framework Based on Historical Data of Smart Devices;2016 IEEE International Conferences on Big Data and Cloud Computing (BDCloud), Social Computing and Networking (SocialCom), Sustainable Computing and Communications (SustainCom) (BDCloud-SocialCom-SustainCom);2016-10