Faster algorithm to find anti-risk path between two nodes of an undirected graph

Authors:
Jay Mahadeokar;Sanjeev Saxena
Affiliations:
Dept. of Computer Science and Engineering, Indian Institute of Technology, Kanpur, India 208 016;Dept. of Computer Science and Engineering, Indian Institute of Technology, Kanpur, India 208 016
Venue:
Journal of Combinatorial Optimization
Year:
2014

Citing 7
Cited 0

Fibonacci heaps and their uses in improved network optimization algorithms

Journal of the ACM (JACM)
Finding the detour-critical edge of a shortest path between two nodes

Information Processing Letters
Applications of Path Compression on Balanced Trees

Journal of the ACM (JACM)
A faster computation of the most vital edge of a shortest path

Information Processing Letters
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Graph Theory with Applications to Engineering and Computer Science (Prentice Hall Series in Automatic Computation)

Graph Theory with Applications to Engineering and Computer Science (Prentice Hall Series in Automatic Computation)
Data structures for range minimum queries in multidimensional arrays

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

For a weighted 2-edge connected graph G=(V,E), we are to find a "minimum risk path" from source s to destination t. This is a shortest s驴t path under the assumption that at most one edge on the path may be blocked. The fact that the edge is blocked is known only when we reach a site adjacent to the blocked edge.If n and m are the number of nodes and edges of G, then we show that this problem can be solved in O(n 2) time using only simple data structures. This is an improvement over the previous O(mn+n 2logn) time algorithm. Moreover, with use of more complicated data structures like Fibonacci Heaps and transmuters the time can be further reduced to O(m+nlogn).