18 citations · 35 across the 11 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.DS2015
Path-Fault-Tolerant Approximate Shortest-Path Trees
Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni +2
Let be an -nodes non-negatively real-weighted undirected graph. In this paper we show how to enrich a {\em single-source shortest-path tree} (SPT) of with a \emph{…
cs.DS2015★ 10 cited
Improved Purely Additive Fault-Tolerant Spanners
Davide Bilò, Fabrizio Grandoni, Luciano Gualà +2
Let be an unweighted -node undirected graph. A \emph{-additive spanner} of is a spanning subgraph of such that distances in are stretched at most by an ad…