- ISSN 0258-2724
- CN 51-1277/U
- EI Compendex
- Scopus
- Indexed by Core Journals of China, Chinese S&T Journal Citation Reports
- Chinese S&T Journal Citation Reports
- Chinese Science Citation Database
| Citation: | FAN Wenli, LIU Zhigang. Ranking Method for Node Importance Based on Efficiency Matrix[J]. Journal of Southwest Jiaotong University, 2014, 27(2): 337-342. doi: 10.3969/j.issn.0258-2724.2014.02.023
|
|
CALLAWAY D S, NEWMAN M E J, STROGATEZ S H, et al. Network robustness and fragility: percolation on random graphs[J]. Phys. Rev. Lett., 2000, 85(25): 5468-5471.
|
|
BRIN S, PAGE L. The anatomy of a large-scale hypertextual web search engine[J]. Computer Networks ISDN Systems, 1998, 30: 107-117.
|
|
KLEINBERG J M. Authoritative sources in a hyperlinked environment//Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA' 98, Society for Industrial and Applied Mathematics. Philadelphia:, 1998: 668-677.
|
|
CORLEY H W, SHA D Y. Most vital links and nodes in weighted networks[J]. Operations Research Letters, 1982, 1(4): 157-160.
|
|
NARDELLI E, PROIETTI G, WIDMAYER P. Finding the most vital node of a shortest path[J]. Theoretical Computer Science, 2001, 296(1): 167-177.
|
|
陈勇, 胡爱群, 胡啸. 通信网中节点重要性的评价方法[J]. 通信学报, 2004, 25(8): 129-134. CHEN Yong, HU Aiqun, HU Xiao. Evaluation method for node importance in communication networks[J]. Journal of China Institute Communications, 2004, 25(8): 129-134.
|
|
谭跃进, 吴俊, 邓宏钟. 复杂网络中节点重要度评估的节点收缩方法[J]. 系统工程理论与实践, 2006, 26(11): 79-83. TAN Yuejin, WU Jun, DENG Hongzhong. Evaluation method for node importance based on node contraction in complex networks[J]. Systems Engineering: Theory Practice, 2006, 26(11): 79-83.
|
|
CHEN Duanbing, LV Linyuan. SHANG Mingsheng, et al. Identifying influential nodes in complex networks[J]. Physica A, 2012, 391(4): 1777-1787.
|
|
陈静, 孙林夫. 复杂网络中节点重要度评估[J]. 西南交通大学学报, 2009, 44(3): 426-429. CHEN Jing, SUN Linfu. Evaluation of node importance in complex networks[J]. Journal of Southwest Jiaotong University, 2009, 44(3): 426-429.
|
|
赵毅寰, 王祖林, 郑晶, 等. 利用重要性贡献矩阵确定通信网中最重要节点[J]. 北京航空航天大学学报, 2009, 35(9): 1076-1079. ZHAO Yihuan, WANG Zulin, ZHENG Jing, et al. Finding most vital node by node importance contribution matrix in communication networks[J]. Journal of Beijing University of Aeronautics and Astronautics, 2009, 35(9): 1076-1079.
|
|
周漩, 张凤鸣, 李克武, 等. 利用重要度评价矩阵确定复杂网络关键节点[J]. 物理学报, 2012, 61(5): 1-5. ZHOU Xuan, ZHANG Fengming, LI Kewu, et al. Finding vital node by node importance evaluation matrix in complex networks[J]. Acta Physica Sinica, 2012, 61(5): 1-5.
|
|
段凡丁. 关于最短路径的SPFA快速算法[J]. 西南交通大学学报, 1994, 29(2): 207-212. DUAN Fanding. A faster algorithm for shortest-ptath-SPFA[J]. Journal of Southwest Jiaotong University, 1994, 29(2): 207-212.
|
DownLoad: