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

Computing 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 corresponding non-tree edge f , in such a way that the tree obtained by replacing e with f enjoys some optimality criterion (which is naturally defined according to some objective function… CONTINUE READING