[1] B.V.Cherkassky,Andrew V.Goldbergy,Tomasz Radzik.Shortest paths algorithms:Theory and experimental evaluation[J].Mathematical programming,1996,73:129-174. [2] H.W.Corley,D.Y.Sha.Most vital links and nodes in weighted networks[J].Oper Res Letters,1982,(1):157-160. [3] M.O.Ball,B.L.Golden,R.v.Vohra.Finding the most vital arcs inanetwork[J].Oper.Res.Lett.1988,(8):73-76. [4] E.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. [5] E.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. [6] E.Nardelli,G.Projetti,P.Widmayer.Finding the most vital node of a shortest path[J].Theoretical computer science 2003,296:167-177. [7] 陈光亭.无向网络中最短路的最关键边问题[J].杭州电子工业学院学报,2002,22(1):48-50. [8] 李引珍.路网上货运路径的计算[J].铁道学报,1997,19(3):14-18. [9] 谢金星,邢文训.网络优化[M].北京:清华大学出版社,2000. |