Study and Improvement of Robustness of Overlay Networks
暂无分享,去创建一个
[1] R. Linsker,et al. Improving network robustness by edge modification , 2005 .
[2] U. Brandes. A faster algorithm for betweenness centrality , 2001 .
[3] A. Rbnyi. ON THE EVOLUTION OF RANDOM GRAPHS , 2001 .
[4] B. Bollobás. The evolution of random graphs , 1984 .
[5] Adilson E Motter,et al. Cascade-based attacks on complex networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.
[6] Albert-László Barabási,et al. Statistical mechanics of complex networks , 2001, ArXiv.
[7] Y. Lai,et al. Attacks and cascades in complex networks , 2004 .
[8] Massimo Marchiori,et al. Error and attacktolerance of complex network s , 2004 .
[9] Mark E. J. Newman. A measure of betweenness centrality based on random walks , 2005, Soc. Networks.
[10] Albert-László Barabási,et al. Error and attack tolerance of complex networks , 2000, Nature.
[11] Heiko Rieger,et al. Random walks on complex networks. , 2004, Physical review letters.