1[3] Newport K T,et al.Network survivability through connectivity optimization.In:proc ICC,1987
2[4] Newport K T,et al.Techniques for evaluating the nodal survivability of large networks.In:proc Milcom,1990
3[5] Newport K T,et al.Design of survivable communication networks under performance constraints.IEEE Trans on Reliability,1991,40(4):433～440
4F P Tsen, T Y Sung, M Y Lin, et al. Finding the most vital edges with respect to the number of spanning trees [ J ]. IEEE Trans Reliability,1994,43(4) :600 - 602.
5M O Ball, B L Golden, R V Vohra. Finding the most vital arcs in a network [J]. Operations Research Letters, 1989,8:73 - 76.
6L B Page, J E Perry. Reliability polynomials and link importance in networks[J]. IEEE Trans. Reliability, 1994,43( 1 ):51 - 58.
7E Nardelli, G Proietti, P Widmayer. Finding the detour-critical edge of a shortest path between two nodes [ J ]. Information Processing Letters,1998,67(1):51 -54.
8E Nardelli, G Proietti, P Widmayer. A faster computation of the most vital edge of a shortest path [J]. Information Processing Letters,2001,79(2) :81 - 85.
9L Traldi. Commentary on: Reliability polynomials and link importance in Networks [J]. IEEE Tmns Reliability,2000,49(3) :322.
10L H Hsu,R H Jan,Y C Lee,et al. Finding the most vital edge with respect to minimum spanning tree in weighted graphs [J]. Information Processing Letters, 1991,39:277 - 281.
