Finding an anti-risk path between two nodes in undirected graphs

DOI10.1007/s10878-007-9110-4zbMath1180.90352OpenAlexW2056436175MaRDI QIDQ732313

Peng Xiao, Bing Su, Yin-Feng Xu

Publication date: 9 October 2009

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-007-9110-4

zbMATH Keywords

shortest pathshortest path treeanti-risk pathmost vital real time edge

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (3)

Finding a contra-risk path between two nodes in undirected graphs ⋮ Faster algorithm to find anti-risk path between two nodes of an undirected graph ⋮ Optimal shortest path set problem in undirected graphs

Cites Work

• 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
• A faster computation of the most vital edge of a shortest path
• Finding the most vital arcs in a network
• Efficiency of a Good But Not Linear Set Union Algorithm
• Unnamed Item

This page was built for publication: Finding an anti-risk path between two nodes in undirected graphs