Finding the anti-block vital edge of a shortest path between two nodes
From MaRDI portal
Publication:1016036
DOI10.1007/s10878-007-9120-2zbMath1159.90011MaRDI QIDQ1016036
Qingchuan Xu, Peng Xiao, Bing Su
Publication date: 4 May 2009
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-007-9120-2
90C35: Programming involving graphs or networks
90B10: Deterministic network models in operations research
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- Finding the detour-critical edge of a shortest path between two nodes
- The k most vital arcs in the shortest path problem
- Most vital links and nodes in weighted networks
- Finding the most vital node of a shortest path.
- A faster computation of the most vital edge of a shortest path
- Improved algorithms for replacement paths problems in restricted graphs