18 citations · 35 across the 11 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
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 -vertex and -edge undirected graph is a spanning tree of 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 of a given -vertex and -edge undirected and weighted graph means to select, for each edge of , a…
cs.GT2017
Rational Fair Consensus in the GOSSIP Model
Andrea Clementi, Luciano Gualà, Guido Proietti +1
The \emph{rational fair consensus problem} can be informally defined as follows. Consider a network of (selfish) \emph{rational agents}, each of them initially supporting a \em…