Finding the most vital arcs in a network
- 1 April 1989
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 8 (2) , 73-76
- https://doi.org/10.1016/0167-6377(89)90003-5
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Most vital links and nodes in weighted networksOperations Research Letters, 1982
- The complexity of finding maximum disjoint paths with length constraintsNetworks, 1982
- A problem in network interdictionNaval Research Logistics Quarterly, 1978
- An O(|V|3) algorithm for finding maximum flows in networksInformation Processing Letters, 1978
- Maximizing the minimum source-sink path subject to a budget constraintMathematical Programming, 1977