Anjeneya Swami Kare

Learn More
Let G = (V, E) be a connected, weighted, undirected graph such that |V| = n and |E| = m. Given a shortest path P<sub>g</sub>(s, t) between a source node s and a sink node t in the graph G, computing the shortest path between source and sink without using a particular edge (or a particular node) in P<sub>g</sub>(s, t) is called Replacement Shortest Path for(More)
Let G = (V, E) (|V | = n and |E| = m) be an undirected graph with positive edge weights. Let PG(s, t) be a shortest s − t path in G. Let l be the number of edges in PG(s, t). The Edge Replacement Path problem is to compute a shortest s − t path in G\{e}, for every edge e in PG(s, t). The Node Replacement Path problem is to compute a shortest s − t path in(More)
  • 1