Skip to main content
SpringerLink
Log in

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

  • Conference paper
Stabilization, Safety, and Security of Distributed Systems (SSS 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6976))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Communications of the ACM 17(11), 643–644 (1974)

    Article  MATH  Google Scholar 

  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)

    Article  Google Scholar 

  3. Ishida, K., Kakuda, Y., Kikuno, T., Amano, K.: A distributed routing protocol for finding two node-disjoint paths in computer networks

    Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  5. Suurballe, J.W.: Disjoint paths in a network. Networks 4, 125–145 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  6. Suurballe, J.W., Tarjan, R.E.: A quick method for finding shortest pairs of disjoint paths. Networks 14, 325–379 (1984)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering, Kuwait University, P.O. Box 5969, Safat, 13060, Kuwait

    Fawaz M. Al-Azemi & Mehmet Hakan Karaata

Authors
  1. Fawaz M. Al-Azemi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mehmet Hakan Karaata
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Information Science, Japan Advanced Institute of Science and Technology (JAIST), Ishikawa, Japan

    Xavier Défago

  2. LIP6/INRIA/UPMC Sorbonne Universities, Paris, France

    Franck Petit

  3. University of Picardie Jules Verne, Picardie, France

    Vincent Villain

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Al-Azemi, F.M., Karaata, M.H. (2011). Brief Announcement: A Stabilizing Algorithm for Finding Two Edge-Disjoint Paths in Arbitrary Graphs. In: Défago, X., Petit, F., Villain, V. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2011. Lecture Notes in Computer Science, vol 6976. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24550-3_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-24550-3_33

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-24549-7

  • Online ISBN: 978-3-642-24550-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation