[1] 高壮良,吕雁飞,张鸿.基于Graphlab的网络图关键节点发现算法研究[J].通信学报,2016,37(3):182-189.(GAO Z L, LYU Y F, ZHANG H. Key nodes discovery in network graph based on Graphlab[J]. Journal on Communications, 2016, 37(3):182-189.)
[2] ARINGHIERI R, GROSSO A, HOSTEINS P, et al. Local search metaheuristics for the critical node problem[J]. Networks, 2016, 67(3):209-221.
[3] ROSATO V, ISSACHAROFF L, TIRITICCO F, et al. Modelling interdependent infrastructures using interacting dynamical models[J]. International Journal of Critical Infrastructures, 2016, 4(1):63-79.
[4] 杨雄,黄德才,张子柯.推荐重要节点部署防御策略的优化模型[J].物理学报,2015,64(5):502-505.(YANG X, HUANG D C, ZHANG Z K. Recommendation of important nodes in deployment optimization model of defense strategy[J]. Acta Physica Sinica, 2015, 64(5):502-505.)
[5] 任晓龙,吕琳媛.网络重要节点排序方法综述[J].科学通报,2014,59(13):1175-1197.(REN X L, LYU L Y. Review of ranking nodes in complex networks[J]. Chinese Science Bulletin, 2014, 59(13):1175-1197.)
[6] VENTRESCA M, ALEMAN D. Efficiently identifying critical nodes in large complex networks[J]. Computational Social Networks, 2015, 2:6-22.
[7] GHOSH R, LERMAN K. Rethinking centrality:the role of dynamical processes in social network analysis[EB/OL].[2018-12-21]. https://arxiv.org/pdf/1209.4616v1.pdf.
[8] 王班,马润年,王刚,等.改进的加权网络节点重要性评估的互信息方法[J].计算机应用,2015,35(7):1820-1823.(WANG B, MA R N, WANG G, et al. Improved evaluation method for node importance based on mutual information in weighted networks[J]. Journal of Computer Applications, 2015, 35(7):1820-1823.)
[9] HUANG D-W, YU Z-G. Dynamic-sensitive centrality of nodes in temporal networks[J]. Scientific Reports, 2017, 7:41454.
[10] 杨剑楠,刘建国,郭强.基于层间相似性的时序网络节点重要性研究[J].物理学报,2018,67(4):272-280.(YANG J N, LIU J G, GUO Q. Node importance idenfication for temporal network based on inter-layer similarity[J]. Acta Physica Sinica, 2018, 67(4):272-280.)
[11] ZHANG J-X, CHEN D-B, DONG Q, et al. Identifying a set of influential spreaders in complex networks[J]. Scientific Reports, 2016, 6:Article No. 27823.
[12] WANG Y, VASILAKOS A V, MA J. VPEF:a simple and effective incentive mechanism in community-based autonomous networks[J]. IEEE Transactions on Network and Service Management, 2015, 12(1):75-86.
[13] 韩忠明,陈炎,李梦琪.一种有效的基于三角结构的复杂网络节点影响力度量模型[J].物理学报,2016,65(16):285-296.(HAN Z M, CHEN Y, LI M Q. An efficient node influence metric based on triangle in complex networks[J]. Acta Physica Sinica, 2016, 65(16):285-296.)
[14] KITSAK M, GALLOS L K, HAVLIN S, et al. Identification of influential spreaders in complex networks[J]. Nature Physics, 2010, 6(11):888-893.
[15] FAN Y, ZHANG R, ZHAO Y, et al. Identifying the most influential spreaders in complex networks by an Extended Local K-Shell Sum[J]. International Journal of Modern Physics C, 2017, 28(1):925-936.
[16] LV L, ZHOU T, ZHANG Q-M, et al. The h-index of a network node and its relation to degree and coreness[J]. Nature Communications, 2016, 7(2):10-16.
[17] LEE Y-L, ZHOU T. Fast asynchronous updating algorithms for k-shell indices[J]. Physica A:Statistical Mechanics and its Applications, 2016, 482(1):524-531.
[18] van BEVERN R, KOMUSIEWICZ C, NIEDERMEIER R, et al. H-index manipulation by merging articles:models, theory, and experiments[C]//IJCAI'15:Proceedings of the 24th International Conference on Artificial Intelligence. Menlo Park, CA:AAAI Press, 2015:808-814.
[19] 贾冲冲,王名扬,车鑫.基于HRank的微博用户影响力评价[J].计算机应用,2015,35(4):1017-1020.(JIA C C, WANG M Y, CHE X. Evaluation of microblog users' influence based on HRank[J]. Journal of Computer Applications, 2015, 35(4):1017-1020.)
[20] WANG C, NING H, BAI Y, et al. A method of network topology optimization design considering application process characteristic[J]. Modern Physics Letters B, 2018, 32(7):85-91.
[21] NEDIC A, OLSHEVSKY A, RABBAT M G. Network topology and communication-computation tradeoffs in decentralized optimization[J]. Proceedings of the IEEE, 2018, 106(5):953-976.
[22] SCHIEBER T A, CARPI L, DÍAZ-GUILERA A, et al. Quantification of network structural dissimilarities[J]. Nature Communications, 2017, 8(1):13-28. |