7 citations · 7 across the 6 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.DM2018
An Interesting Structural Property Related to the Problem of Computing All the Best Swap Edges of a Tree Spanner in Unweighted Graphs
Davide Bilò, Kleitos Papadopoulos
In this draft we prove an interesting structural property related to the problem of computing {\em all the best swap edges} of a {\em tree spanner} in unweighted graphs. Previous p…
cs.DS2018
A Novel Algorithm for the All-Best-Swap-Edge Problem on Tree Spanners
Davide Bilò, Kleitos Papadopoulos
Given a 2-edge connected, unweighted, and undirected graph with vertices and edges, a -tree spanner is a spanning tree of in which the ratio between the dist…