2B.V.Cherkassky,Andrew V.Goldbergy,Tomasz Radzik.Shortest paths algorithms:Theory and experimental evaluation[J].Mathematical programming,1996,73:129-174.
3H.W.Corley,D.Y.Sha.Most vital links and nodes in weighted networks[J].Oper Res Letters,1982,(1):157-160.
4M.O.Ball,B.L.Golden,R.v.Vohra.Finding the most vital arcs inanetwork[J].Oper.Res.Lett.1988,(8):73-76.
5E.Nardlli,G.Proietti,P.Widmayer.Finding the detour-critical edge of a shortest path between nodes[J].Infor Proc Letters,1998,67(1):51-54.
6E.Nardelli,G.Proietti,P.Widmyer.A faster computation of the most vital edge of a shortest path between two nodes.Inform.Process.Lett.2001,79(2):81-85.
7E.Nardelli,G.Projetti,P.Widmayer.Finding the most vital node of a shortest path[J].Theoretical computer science 2003,296:167-177.
8Corley H W, Sha D Y. Most vital links and nodes in weighted networks[J]. Oper Res Letters, 1982,(1):157-160.
9Nardelli E, Proietti G, Widmayer P. Finding the most vital node of a shortest path[J]. Theoretical computer science, 2003(296): 167-177.
10Ball M O, Golden B L, Vohra R V. Finding the most vital arcs in a network[J]. Oper. Res. Lett. 1989(8):73-76.
