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 …

Recently great attention has been given to point-of-failure swap rerouting, an efficient
technique for routing in the presence of transient failures. According to this technique, a …

The problem of two node-disjoint paths is to identify two paths 𝒬 1 and 𝒬 2 from source s∈ V
to target t∈ V without any common intermediate node in a communication network G=(V, E) …

We study the problem of distributed traffic control in the partitioned plane, where the
movement of all entities (robots, vehicles, etc.) within each geographic partition (cell) is the …

Sažetak Given two distinct vertices (nodes) source s and target t of a graph G=(V, E), the two
node-disjoint paths problem is to identify two node-disjoint paths between s∈ V and t∈ V …

In systems using shortest-path routing tables, a single link failure is enough to interrupt the
message transmission by disconnecting one or more shortest path spanning trees. The on …

We present the first adaptive stabilizing algorithm for finding two node disjoint paths in
anonymous arbitrary networks. Given a graph G=(V, E), two paths from source s∈ V to target …

We consider the problem of computing the best swap edges of a shortest-path tree T r rooted
in r. That is, given a single link failure: if the path is not affected by the failed link, then the …

We study the problem of distributed traffic control in the partitioned plane, where the
movement of all entities (vehicles) within each partition (cell) is coupled. Establishing …