Path-Fault-Tolerant Approximate Shortest-Path Trees

Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni +2

Let $G=(V,E)$ be an $n$-nodes non-negatively real-weighted undirected graph. In this paper we show how to enrich a {\em single-source shortest-path tree} (SPT) of $G$ with a \emph{…