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 G with n vertices and m edges, a sigma-tree spanner is a spanning tree T of G in which the ratio between the distance in T of any pair of vertices and the corresponding distance in G is upper bounded by sigma. The minimum value of sigma for which T is a sigma-tree spanner of G is also called the stretch factor of T. We address the...
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.