Author:
Molnár F.,Sreenivasan S.,Szymanski B. K.,Korniss G.
Publisher
Springer Science and Business Media LLC
Reference37 articles.
1. Eubank, S., Anil Kumar, V. S., Marathe, M. V., Srinivasan, A. & Wang, N. Structural and algorithmic aspects of massive social networks. In SODA '04 Proc. of the fifteenth annual ACM-SIAM symposium on Discrete algorithms., 718–727 (2004).
2. Cowan, N. J., Chastain, E. J., Vilhena, D. A., Freudenberg, J. S. & Bergstrom, C. T. Nodal Dynamics, Not Degree Distributions, Determine the Structural Controllability of Complex Networks. PLoS ONE 7(6), e38398 (2012).
3. Kelleher, L. & Cozzens, M. Dominating Sets in Social Network Graphs. Math. Soc. Sciences 16, 267–279 (1988).
4. Wang, F. et al. On positive influence dominating sets in social networks. Theo. Comp. Sci. 412, 265–269 (2011).
5. Broder, A. et al. Graph structure in the web. Computer Networks: The International Journal of Computer and Telecommunications Networking 33, 309–320 (2000).
Cited by
47 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献