Faster algorithm to find anti-risk path between two nodes of an undirected graph
From MaRDI portal
Publication:2015812
DOI10.1007/s10878-012-9553-0zbMath1291.90287OpenAlexW1995714268MaRDI QIDQ2015812
Sanjeev Saxena, Jay Mahadeokar
Publication date: 24 June 2014
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-012-9553-0
Related Items
Cites Work
- Unnamed Item
- 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
- Finding an anti-risk path between two nodes in undirected graphs
- A faster computation of the most vital edge of a shortest path
- Applications of Path Compression on Balanced Trees
- Fibonacci heaps and their uses in improved network optimization algorithms