The k most vital arcs in the shortest path problem

Authors:
K. Malik;A. K. Mittal;S. K. Gupta
Affiliations:
Johnson Graduate School of Management, Cornell University, Ithaca, NY 14853-4201, USA;Indian Institute of Technology, Kanpur, India;Indian Institute of Technology, Kanpur, India
Venue:
Operations Research Letters
Year:
1989

Citing 4
Cited 6

Fibonacci heaps and their uses in improved network optimization algorithms

Journal of the ACM (JACM)
Graph Algorithms

Graph Algorithms
Most vital links and nodes in weighted networks

Operations Research Letters
Finding the most vital arcs in a network

Operations Research Letters

Decision support for network disruption mitigation

Decision Support Systems
Improved algorithms for the k simple shortest paths and the replacement paths problems

Information Processing Letters
A bi-objective approach for shortest-path network interdiction

Computers and Industrial Engineering
Improved algorithms for replacement paths problems in restricted graphs

Operations Research Letters
Replacement paths and k simple shortest paths in unweighted directed graphs

ACM Transactions on Algorithms (TALG)
Faster replacement paths algorithms in case of edge or node failure for undirected, positive integer weighted graphs

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

The k most vital arcs in a network are those whose removal from the network results in the greatest increase in the shortest distance between two specified nodes. An exact algorithm is proposed to determine the k most vital arcs. Furthermore, an algorithm of time complexity equal to that of Dijkstra's algorithm for the shortest path problem is developed to solve the single most vital arc problem.