Feliciano Colella

collaborators

2 papers

cs.DS2017

An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner

Davide Bilò, Feliciano Colella, Luciano Gualà +2

A tree $σ$ -spanner of a positively real-weighted $n$ -vertex and $m$ -edge undirected graph $G$ is a spanning tree $T$ of $G$ which approximately preserves (i.e., up to a multiplicat…

cs.DS2017

Effective Edge-Fault-Tolerant Single-Source Spanners via Best (or Good) Swap Edges

Davide Bilò, Feliciano Colella, Luciano Gualà +2

Computing \emph{all best swap edges} (ABSE) of a spanning tree $T$ of a given $n$ -vertex and $m$ -edge undirected and weighted graph $G$ means to select, for each edge $e$ of $T$ , a…