Nowadays, a majority of the Internet service providers are either piloting or migrating to
software-defined networking (SDN) in their networks. In an SDN architecture a central …

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 …

We consider the problem of computing the optimal swap edges of a shortest-path tree. This
problem arises in designing systems that offer point-of-failure shortest-path rerouting service …

We introduce a new recovery scheme that needs only one extra backup routing table for
networks employing shortest-path routing. By precomputing this backup table, the network …

We consider a two-edge connected, non-negatively real-weighted graph G with n vertices
and m edges, and a single-source shortest paths tree (SPT) of G rooted at an arbitrary …

A tree σ σ-spanner of a positively real-weighted n-vertex and m-edge undirected graph G is
a spanning tree T of G which approximately preserves (ie, up to a multiplicative stretch factor …

Abstract Let G=(V, E) be an n-nodes non-negatively real-weighted undirected graph. In this
paper we show how to enrich a single-source shortest-path tree (SPT) of G with a sparse set …

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 …

We consider a 2-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 …

We consider the problem of computing the optimal swap edges of a shortest-path tree. This
theoretical problem arises in practice in systems that offer point-of-failure shortest-path …