1Kris T.Newport.Design of Survivable Communications Networks under Performance Constraints[J].IEEE Transactions on Reliability 1991,40(4):433-440.
2高京伟.[D].西安:西安电子科技大学,2004.
3F.P.Tsen,T.Y.Sung,M.Y.Lin.Finding the Most Vitial Edges with Respect to the Number of Spanning Trees[J].IEEE Transactions on Reliability,1994,43(4):600-602.
1F 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.
2M O Ball, B L Golden, R V Vohra. Finding the most vital arcs in a network [J]. Operations Research Letters, 1989,8:73 - 76.
3L B Page, J E Perry. Reliability polynomials and link importance in networks[J]. IEEE Trans. Reliability, 1994,43( 1 ):51 - 58.
4E 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.
5E 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.
6L Traldi. Commentary on: Reliability polynomials and link importance in Networks [J]. IEEE Tmns Reliability,2000,49(3) :322.
7L 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.
8V V B Rao. Most-vital edge of a graph with respect to spanning trees[ J ]. IEEE Trans. Reliability, 1998,47 ( 1 ) :6 - 7.
9M N S Swamy, K Thulasiraman. Graphs, Networks, and Algorithms[ M ]. New York : John Wiley & Sons Inc, 1981.
