10 citations · 22 across the 12 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★ 6 cited
Sorting with Recurrent Comparison Errors
Barbara Geissmann, Stefano Leucci, Chih-Hung Liu +1
We present a sorting algorithm for the case of recurrent random comparison errors. The algorithm essentially achieves simultaneously good properties of previous algorithms for sort…
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…