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

DOI10.1007/S10878-007-9110-4zbMATH Open1180.90352OpenAlexW2056436175MaRDI QIDQ732313FDOQ732313

Authors: Peng Xiao, Bing Su, Yinfeng 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

Recommendations

• Faster algorithm to find anti-risk path between two nodes of an undirected graph
• Finding a contra-risk path between two nodes in undirected graphs
• The optimal rescue path set problem in undirected graphs
• On the Minimum Risk-Sum Path Problem
• Optimal shortest path set problem in undirected graphs

zbMATH Keywords

shortest pathanti-risk pathmost vital real time edgeshortest path tree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• The k most vital arcs in the shortest path problem
• Finding the most vital arcs in a network
• Efficiency of a Good But Not Linear Set Union Algorithm
• Most vital links and nodes in weighted networks
• Finding the detour-critical edge of a shortest path between two nodes
• A faster computation of the most vital edge of a shortest path
• Title not available (Why is that?)

Cited In (4)

• The optimal rescue path set problem in undirected graphs
• 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

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

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