Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs
- 7 June 2004
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 102 (2) , 355-369
Abstract
No abstract availableKeywords
All Related Versions
This publication has 21 references indexed in Scilit:
- Parallel Algorithm for Finding the Most Vital Edge in Weighted GraphsJournal of Parallel and Distributed Computing, 1997
- NC algorithms for the single most vital edge problem with respect to shortest pathsInformation Processing Letters, 1996
- A randomized linear-time algorithm to find minimum spanning treesJournal of the ACM, 1995
- Network Flows: Theory, Algorithms, and Applications.Journal of the Operational Research Society, 1994
- A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphsAlgorithmica, 1994
- Finding the most vital edge with respect to minimum spanning tree in weighted graphsInformation Processing Letters, 1991
- The k most vital arcs in the shortest path problemOperations Research Letters, 1989
- A simple version of Karzanov's blocking flow algorithmOperations Research Letters, 1984
- Arc tolerances in shortest path and network flow problemsNetworks, 1980
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972