Swapping a Failing Edge of a Shortest Paths Tree by Minimizing the Average Stretch Factor


We consider a two-edge connected, undirected graph G = (V, E), with n nodes and m non-negatively real weighted edges, and a single source shortest paths tree (SPT) T of G rooted at an arbitrary node r . If an edge in T is temporarily removed, it makes sense to reconnect the nodes disconnected from the root by adding a single non-tree edge, called a swap… (More)
DOI: 10.1007/978-3-540-27796-5_10


2 Figures and Tables

Slides referencing similar topics