A distributed algorithm for edge-disjoint path problem

  • H. Mohanty
  • G. P. Bhattacharjee
Session 5 Distributed Computing
Part of the Lecture Notes in Computer Science book series (LNCS, volume 241)


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.


Adjacent Vertex Request Message Disjoint Path Adjacent Edge Message Complexity 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Dijkstra E.W. and C.S.Scholten; Terminal Detection for Diffusing Computations; Info. Proc. Letters; Vol. 11, No. 1, 1980.Google Scholar
  2. 2.
    Ernest J.H. Chang; Echo Algorithms: Depth Parallel Operations on General Graphs, IEEE Trans. on Soft. Eng., Vol. SE-8, No.4, July 1982, 391–401.Google Scholar
  3. 3.
    E.Korach, D.Rotem and N.Sontoro; Distributed Election in a Circle without a Global Sense of Orientation; Intern. J.Computer Math., Vol. 16, 115–124.Google Scholar
  4. 4.
    Jurgen Ebert; A Linear Disjoint Path Algorithm; Osnabrucker Schrifien Zur Mathematick, Heft 43, 1982, 1–9.Google Scholar
  5. 5.
    K.M. Chandy and J. Misra; Distributed Computations on Graphs: Shortest Path Algorithms; Comm. of the ACM, Vol.25, No.11, Nov.1982, 833–837.Google Scholar
  6. 6.
    R.G. Gallager, P.A. Humblet and P.M. Spira; A Distributed Algorithm for Minimum-Weight Spanning Trees; Acm Tr. on Prog. lang. and Systems, Vol.5, No.1, Jan. 1983, 66–67.Google Scholar
  7. 7.
    To-Yat Cheung; Graph Traversal Techniques and the Maximum Flow Problem in Distributed Computation; IEEE Trans. on Soft. Eng., Vol. SE-9, No.4, July, 1983, 504–512.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • H. Mohanty
    • 1
  • G. P. Bhattacharjee
    • 2
  1. 1.MSG Electronics Corporation of India LimitedHyderabadIndia
  2. 2.Department of MathematicsIndian Institute of TechnologyKharagpurIndia

Personalised recommendations