Skip to main content
SpringerLink
Log in

A Self-stabilizing Algorithm For 3-Edge-Connectivity

  • Conference paper
Parallel and Distributed Processing and Applications (ISPA 2007)

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

Abstract

The adoption of self-stabilization as an approach to fault-tolerant behavior has received considerable research interest over the last decade. In this paper, we propose a self-stabilizing algorithm for 3-edge-connectivity of an asynchronous distributed model of computation. The self-stabilizing depth-first search algorithm of Collin and Dolev [4] is run concurrently to build a depth-first search spanning tree of the system. Once such a tree of height h is constructed, the detection of all 3-edge-connected components of the system requires O(h) rounds. The result of computation is kept in a distributed fashion in the sense that, upon stabilization of another phase of the algorithm, each processor knows all other processors that are 3-edge-connected to it. Until now, this is the only algorithm to compute all the 3-edge-connected components in the context of self-stabilization. Assuming that every processor requires m bits for the depth-first search algorithm, the space complexity of our algorithm is O(hm) bits per processor.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Burns, J.E., Gouda, M., Miller, R.: On relaxing interleaving assumptions. In: Proceedings of the MCC Workshop on Self-stabilizing Systems, MCC technical Report No. STP-379-89 (1989)

    Google Scholar 

  2. Chaudhuri, P.: A self-stabilizing algorithm for detecting fundamental cycles in a graph. Journal of Computer and System Science 59(1), 84–93 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  3. Chaudhuri, P.: An O(n 2) self-stabilizing algorithm for computing bridge-connected components. Computing 62(1), 55–67 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  4. Collin, Z., Dolev, S.: Self-stabilizing depth-first search. Information Processing Letters 49(6), 297–301 (1994)

    Article  MATH  Google Scholar 

  5. Devismes, S.: A silent self-stabilizing algorithm for finding cut-nodes and bridges. Parallel Processing Letters 15(1&2), 183–198 (2005)

    Article  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  7. Dolev, S., Israeli, A., Moran, S.: Uniform dynamic self-stabilizing leader election. IEEE Trans. on Parallel and Distributed Systems 8(4), 424–440 (1997)

    Article  Google Scholar 

  8. Jennings, E., Motyckova, L.: Distributed computations and maintenace of 3-edge-connected components during edge insertions. In: Proceedings of the 3rd Colloquium SIROCCO 1996, Certosa di Pontignano, Siena, pp. 224–240 (June 1996)

    Google Scholar 

  9. Karaata, M.H.: A self-stabilizing algorithm for finding articulation points. International Journal of Foundations of Computer Sciences 10(1), 33–46 (1999)

    Article  MathSciNet  Google Scholar 

  10. Karaata, M.H.: A stabilizing algorithm for finding biconnected components. Journal of Parallel and Distributed Computing 62(5), 982–999 (2002)

    Article  MATH  Google Scholar 

  11. Karaata, M.H., Chaudhuri, P.: A self-stabilizing algorithm for bridge finding. Distributed Computing 12(1), 47–53 (1999)

    Article  Google Scholar 

  12. Taoka, S., Watanabe, T., Onaga, K.: A linear time algorithm for computing all 3-edge-connected components of a multigraph. IEICE Trans. Fundamentals E75(3), 410–424 (1992)

    Google Scholar 

  13. Tarjan, R.E.: Depth-first search and linear graph algorithms. SIAM J. Computing IV, 146–160 (1972)

    Article  MathSciNet  Google Scholar 

  14. Tsin, Y.H.: An efficient distributed algorithm for 3-edge-connectivity. International Journal of Foundations of Computer Science 17(3), 677–701 (2006)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer and Inf. Science and Engineering, University of Florida, Gainesville, Florida, USA

    Abusayeed M. Saifullah

  2. School of Computer Science, University of Windsor, Windsor, Ontario, Canada

    Yung H. Tsin

  3. Research partially supported by NSERC under grant NSERC-781103,  

    Yung H. Tsin

Authors
  1. Abusayeed M. Saifullah
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yung H. Tsin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ivan Stojmenovic Ruppa K. Thulasiram Laurence T. Yang Weijia Jia Minyi Guo Rodrigo Fernandes de Mello

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Saifullah, A.M., Tsin, Y.H. (2007). A Self-stabilizing Algorithm For 3-Edge-Connectivity. In: Stojmenovic, I., Thulasiram, R.K., Yang, L.T., Jia, W., Guo, M., de Mello, R.F. (eds) Parallel and Distributed Processing and Applications. ISPA 2007. Lecture Notes in Computer Science, vol 4742. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74742-0_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74742-0_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74741-3

  • Online ISBN: 978-3-540-74742-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation