Abstract
This paper proposes the optimal rescue path set problem in an undirected graph G = (V,E), in which some vehicles have to go from a source node s to a destination node t. However, during the traveling of the vehicles, there might exist one edge blocked in the graph. The goal is to find a minimum collection of paths for the vehicles, to guarantee the fastest arrival of at least one vehicle no matter which edge is blocked. We present an algorithm for the above optimal rescue path set problem, and prove that the complexity of our algorithm is O(m + n logn).
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call