Finding the Anti-block Vital Edge of a Shortest Path Between Two Nodes

DOI10.1007/978-3-540-73556-4_4MaRDI QIDQ3611946zbMATH OpenOpenAlexFDO

Authors Bing Su, Qingchuan Xu, Peng Xiao

Publication date 3 March 2009

Published in Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73556-4_4

Mathematics Subject Classification ID

Paths and cycles (05C38) Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Recommendations

• Finding the anti-block vital edge of a shortest path between two nodes
• scientific article; zbMATH DE number 1796972
• Finding the detour-critical edge of a shortest path between two nodes
• A faster computation of the most vital edge of a shortest path
• Finding the most vital node of a shortest path.
• A refined complexity analysis of finding the most vital edges for undirected shortest paths
• Finding the shortest paths by node combination
• A more fine-grained complexity analysis of finding the most vital edges for undirected shortest paths
• A block-parametric method for finding shortest paths in a graph
• Finding next-to-shortest paths in a graph

Cited in

(2)

• Finding the anti-block vital edge of a shortest path between two nodes
• scientific article; zbMATH DE number 1796972 (Why is no real title available?)

This page was built for publication: Finding the Anti-block Vital Edge of a Shortest Path Between Two Nodes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3611946)