Finding a contra-risk path between two nodes in undirected graphs

DOI10.1007/s10878-015-9912-8zbMath1354.90152OpenAlexW755651516MaRDI QIDQ326494

Iman Keshtkar, Mehdi Ghiyasvand

Publication date: 12 October 2016

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

Full work available at URL: https://doi.org/10.1007/s10878-015-9912-8

zbMATH Keywords

network flowsshortest path problemanti-risk path

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• Finding the detour-critical edge of a shortest path between two nodes
• Finding an anti-risk path between two nodes in undirected graphs
• The k most vital arcs in the shortest path problem
• A faster computation of the most vital edge of a shortest path
• Faster algorithm to find anti-risk path between two nodes of an undirected graph
• Optimal shortest path set problem in undirected graphs
• Algorithmic mechanism design (extended abstract)
• Unnamed Item
• Unnamed Item

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