Optimal Distributed Replacement Paths

Yi-Jun Chang, Yanyu Chen, Dipan Dey +3

We study the replacement paths problem in the $\mathsf{CONGEST}$ model of distributed computing. Given an $s$-$t$ shortest path $P$, the goal is to compute, for every edge $e$ in $…