The k most vital arcs in the shortest path problem

Ahuja, 1987, Faster algorithms for the shortest path problem

Ball, 1989, Finding the most vital arcs in a network, Oper. Res. Lett., 8, 73, 10.1016/0167-6377(89)90003-5

Corley, 1982, Most vital links and nodes in weighted networks, Oper. Res. Lett., 1, 157, 10.1016/0167-6377(82)90020-7

Even, 1979

Ford, 1962

Fredman, 1984, Fibonacci heaps and their uses in improved network optimization algorithms, 338

Fredman, 1987, Journal of ACM, 34, 596, 10.1145/28869.28874

Johnson, 1982, A priority queue in which initialization and queue operations take O(log log D) time, Math. Sys. Theory, 15, 295, 10.1007/BF01786986

Katoh, 1982, An efficient algorithm for k shortest simple paths, Networks, 12, 411, 10.1002/net.3230120406

Malik, 1983, k most vital links in the shortest path problem

Murty, 1976