Undirected 3-Fault Replacement Path in Nearly Cubic Time

Shucheng Chi, Ran Duan, Benyu Wang +1

Given a graph $G=(V,E)$ and two vertices $s,t\in V$, the $f$-fault replacement path ($f$FRP) problem computes for every set of edges $F$ where $|F|\le f$, the distance from $s$ to…