[1]
E. Nardelli, G. Proietti, P. Widmyer. Finding the most vital node of a shortest path[J]. Theoretical Computer Science, 2003, 296(1): 167-177.
DOI: 10.1016/s0304-3975(02)00438-3
Google Scholar
[2]
Y. Chen, A. Q. Hu, X. Hu. Evaluation method for node importance in communication networks[J]. Journal of China Institute of Communications, 2004, 25(8): 129-134.
Google Scholar
[3]
Y. H. Zhao, Z. L. Wang, J. Zheng, X. J. Guo. 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.
Google Scholar
[4]
Yu Xin, Li Yanhe, Zheng Xiaoping, et al. Node importance evaluation based on communication network performance grads[J]. Tsinghua Science and Technology, 2008, 48(8): 541-544.
Google Scholar
[5]
Kermarrec A, Merrer E L, Sericola B, et al. Second order centrality: Distributed assessment of nodes criticity in complex networks[J]. Computer Communications, 2011, 34(5): 619-628.
DOI: 10.1016/j.comcom.2010.06.007
Google Scholar
[6]
He Nan, Gan Wenyan, Li Deyi. Evaluate nodes importance in the network using data field theory[C]. IEEE International Conference on Convergence Information Technology, IEEE Press, Korea, 2007: 1225-1234.
DOI: 10.1109/iccit.2007.88
Google Scholar
[7]
Holme P. Congestion and centrality in traffic flow on complex networks[J]. Advances in Complex Systems, 2003, 6(2): 163-176.
DOI: 10.1142/s0219525903000803
Google Scholar
[8]
L. Wang, J. J. Zhang. Centralization of complex networks[J]. Complex systems and complexity science, 2006, 3 (1): 13-20.
Google Scholar
[9]
A. R, J. H, B. AL. Error and attack tolerance of complex networks[J]. Nature, 2000, 406(6794): 378-382.
DOI: 10.1038/35019019
Google Scholar