Most vital links and nodes in weighted networks

Authors:
H.W Corley;David Y Sha
Affiliations:
Department of Industrial Engineering, The University of Texas at Arlington, Arlington, TX 76019, U.S.A.;Department of Industrial Engineering, The University of Texas at Arlington, Arlington, TX 76019, U.S.A.
Venue:
Operations Research Letters
Year:
1982

Citing 2
Cited 8

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Graph Theory with Applications to Engineering and Computer Science (Prentice Hall Series in Automatic Computation)

Graph Theory with Applications to Engineering and Computer Science (Prentice Hall Series in Automatic Computation)

Modeling s-t path availability to support disaster vulnerability assessment of network infrastructure

Computers and Operations Research
A bi-objective approach for shortest-path network interdiction

Computers and Industrial Engineering
An s-t connection problem with adaptability

Discrete Applied Mathematics
Critical infrastructure protection: The vulnerability conundrum

Telematics and Informatics
Finding the most vital arcs in a network

Operations Research Letters
The k most vital arcs in the shortest path problem

Operations Research Letters
A decomposition approach for solving critical clique detection problems

SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Maximum dynamic network flow interdiction problem: New formulation and solution procedures

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

The n most vital links (or nodes) in a weighted network are those n links (nodes) whose removal from the network results in the greatest increase in shortest distance between two specified nodes. Preliminary results are presented for obtaining these entities.