Brief Announcement: A Stabilizing Algorithm for Finding Two Edge-Disjoint Paths in Arbitrary Graphs
- 894 Downloads
Given two distinct nodes s and t of a directed graph G = (V,E), where V is the set of nodes and E is the set of arcs, the problem of identifying two edge-disjoint paths from s to t is to identify two distinct paths Q 1 and Q 2 from s to t such that Q 1 and Q 2 share no common arc.
KeywordsDisjoint paths fault-tolerance stabilization
- 3.Ishida, K., Kakuda, Y., Kikuno, T., Amano, K.: A distributed routing protocol for finding two node-disjoint paths in computer networksGoogle Scholar