A distributed algorithm for edge-disjoint path problem

Abstract

A distributed algorithm for finding two edge-disjoint paths from a given vertex to all other vertices of a biconnected graph G = (V, E) is presented in this paper. The problem is divided into three sub-problems viz., i) Breadth-First Search ii) Edge Designation iii) Disjoint path Detection. The algorithms for all the three sub-problems require O(d) time where d is the diameter of graph. The communication complexity for the first sub-problem is O(d | E |).The second and the third sub-problems have O(| V |) and O(| V | | E |) message complexities respectively.