Finding the most vital arcs in a network

Corley, 1982, Most vital links and nodes in weighted networks, Operations Research Letters, 1, 157, 10.1016/0167-6377(82)90020-7

Fulkerson, 1977, Maximizing the minimum source-sink path subject to a budget constraint, Mathematical Programming, 13, 116, 10.1007/BF01584329

Garey, 1979

Golden, 1978, A problem in network interdiction, Naval Research Logistics Quarterly, 24, 711, 10.1002/nav.3800250412

Itai, 1982, The complexity of finding maximum disjoint paths with length constraints, Networks, 12, 277, 10.1002/net.3230120306

Malik, 1983

Malhotra, 1978, An O(| V |3) algorithm for finding maximum flows in networks, Information Processing Letters, 7, 227, 10.1016/0020-0190(78)90016-9

Provan, 1988, Exact cuts in networks, Networks