Replacement Paths Problem: Difference between revisions
Jump to navigation
Jump to search
(Created page with "{{DISPLAYTITLE:Replacement Paths Problem (Shortest Path (Directed Graphs))}} == Description == Given nodes $s$ and $t$ in a weighted directed graph and a shortest path $P$ from $s$ to $t$, compute the length of the shortest simple path that avoids edge $e$, for all edges $e$ on $P$ == Related Problems == Generalizations: st-Shortest Path Related: General Weights, Nonnegative Weights, Nonnegative Integer Weights, Second Shortest Simple Path, 1-...") |
No edit summary |
||
| Line 12: | Line 12: | ||
== Parameters == | == Parameters == | ||
$V$: number of vertices | |||
$E$: number of edges | |||
$L$: maximum absolute value of edge cost | |||
== Table of Algorithms == | == Table of Algorithms == | ||
Currently no algorithms in our database for the given problem. | Currently no algorithms in our database for the given problem. | ||
Latest revision as of 07:52, 10 April 2023
Description
Given nodes $s$ and $t$ in a weighted directed graph and a shortest path $P$ from $s$ to $t$, compute the length of the shortest simple path that avoids edge $e$, for all edges $e$ on $P$
Related Problems
Generalizations: st-Shortest Path
Related: General Weights, Nonnegative Weights, Nonnegative Integer Weights, Second Shortest Simple Path, 1-sensitive (3/2)-approximate ss-shortest paths, 2-sensitive (7/5)-approximate st-shortest paths, 1-sensitive decremental st-shortest paths, 2-sensitive decremental st-shortest paths
Parameters
$V$: number of vertices
$E$: number of edges
$L$: maximum absolute value of edge cost
Table of Algorithms
Currently no algorithms in our database for the given problem.