Replacement Paths for Pairs of Shortest Path Edges in Directed Graphs

@inproceedings{BhosleReplacementPF,
  title={Replacement Paths for Pairs of Shortest Path Edges in Directed Graphs},
  author={Amit M. Bhosle}
}
The (Single-Edge) Replacement Paths problem is defined as follows: Given a weighted graph G(V, E), two nodes s and t, and the shortest path PG(s, t) = {e1, e2, . . . , ep} froms to t in G, compute the shortest path from s to t in the graphG\ei for 1 ≤ i ≤ p. In other words, the single-edge replacement paths problem studies how a given s-t shortest path changes with the deletion of an edge lying on the path. We study atwo-edgegeneralization of this problem for directedgraphs, termed theEdge… CONTINUE READING