Advertisement

Brief Announcement: A Stabilizing Algorithm for Finding Two Edge-Disjoint Paths in Arbitrary Graphs

  • Fawaz M. Al-Azemi
  • Mehmet Hakan Karaata
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6976)

Introduction

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.

Keywords

Disjoint paths fault-tolerance stabilization 

References

  1. 1.
    Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Communications of the ACM 17(11), 643–644 (1974)CrossRefzbMATHGoogle Scholar
  2. 2.
    Hadid, R., Karaata, M.H.: An adaptive stabilizing algorithm for finding all disjoint paths in anonymous mesh networks. Computer Communications 32(5), 858–866 (2009)CrossRefGoogle Scholar
  3. 3.
    Ishida, K., Kakuda, Y., Kikuno, T., Amano, K.: A distributed routing protocol for finding two node-disjoint paths in computer networksGoogle Scholar
  4. 4.
    Ogier, R.G., Rutenburg, V., Shacham, N.: Distributed algorithms for computing shortest pairs of disjoint paths. IEEE Transactions on Information Theory 39(2), 443–455 (1993)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Suurballe, J.W.: Disjoint paths in a network. Networks 4, 125–145 (1974)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Suurballe, J.W., Tarjan, R.E.: A quick method for finding shortest pairs of disjoint paths. Networks 14, 325–379 (1984)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Fawaz M. Al-Azemi
    • 1
  • Mehmet Hakan Karaata
    • 1
  1. 1.Department of Computer EngineeringKuwait UniversitySafatKuwait

Personalised recommendations