2Corley H W, Sha D Y. Most vital links and nodes in weighted networks [J]. Oper Res Lett, 1982, 1:157 - 160.
3Nardelli E, Proietti G, Widmayer P. Finding the most vital node of a shortest path [J]. Theoretical Computer Science, 2001, 296(1): 167- 177.
4Erdos P, Renyi A. On random graphs [J]. Publ Math, 1959, 6:290 - 297.
5Watts D J, Strogatz S H. Collective dynamics of‘small-world' networks [J]. Nature, 1998, 393:440- 442.
6Barabasi A L, Albert R. Emergence of scaling in random networks [J]. Science, 1999, 286:509 - 512.
7Callaway 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.
8Albert R, Jeong H, Barabasi A-L. Error and attack tolerance of complex networks [J]. Nature, 2000, 406:378 -382.
9Gallos L K, Cohen R, Argyrakis P. Stability and topology of scale-free networks under attack and defense strategies [J]. Phys Rev Lett, 2005, 94: 188701.
10Ball M O, Golden B L, Vohra R V. Finding the most vital ares in a network [J]. Oper Res Lett, 1989, 8:73 -76.
