NC algorithms for the Single Most Vital Edge problem with respect to shortest paths
From MaRDI portal
Publication:673229
DOI10.1016/S0020-0190(96)00172-XzbMath0900.68240OpenAlexW2000869287MaRDI QIDQ673229
Hong Shen, Sven Venema, Francis Suraweera
Publication date: 28 February 1997
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0190(96)00172-x
Related Items (2)
Finding the most vital node of a shortest path. ⋮ Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs
Cites Work
- Unnamed Item
- The k most vital arcs in the shortest path problem
- Most vital links and nodes in weighted networks
- Finding the most vital edge with respect to minimum spanning tree in weighted graphs
- Parallel algorithms for finding the most vital edge with respect to minimum spanning tree
- Efficient algorithms for finding the most vital edge of a minimum spanning tree
- Improved parallel algorithms for finding the most vital edge of a graph with respect to minimum spanning tree∗
This page was built for publication: NC algorithms for the Single Most Vital Edge problem with respect to shortest paths
