Learn More
Let P G (s, t) denote a shortest path between two nodes s and t in an undi-rected graph G with nonnegative edge weights. A detour at a node u ∈ P G (s, t) = t) is defined as a shortest path P G−e (u, t) from u to t which does not make use of (u, v). In this paper, we focus on the problem of finding an edge e = (u, v) ∈ P G (s, t) whose removal produces a(More)
  • 1