Finding the anti-block vital edge of a shortest path between two nodes

DOI10.1007/s10878-007-9120-2zbMath1159.90011OpenAlexW2797439625MaRDI 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

zbMATH Keywords

shortest pathanti-block vital edgeedge failures

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Bound and exact methods for assessing link vulnerability in complex networks

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

This page was built for publication: Finding the anti-block vital edge of a shortest path between two nodes