Skip to main content
SpringerLink
Log in

A self-stabilizing algorithm for bridge finding

  • Original article
  • Published:
Distributed Computing Aims and scope Submit manuscript

Summary.

A self-stabilizing algorithm is presented in this paper that finds the bridges of a connected undirected graph on a distributed or network model of computation after \(O(\vert E\vert n^2)\) moves. The algorithm is resilient to transient faults and does not require initialization. In addition, a correctness proof of the algorithm is provided. The paper concludes with remarks on the time complexity of the algorithm.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Electrical and Computer Engineering, Kuwait University, P.O. Box 5969 Safat-13060 Kuwait, (e-mail: {karaata, pranay}@eng.kuniv.edu.kw) , , , , , , KW

    Mehmet Hakan Karaata & Pranay Chaudhuri

Authors
  1. Mehmet Hakan Karaata
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pranay Chaudhuri
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received: July 1997 / Accepted: January 1999

Rights and permissions

Reprints and permissions

About this article

Cite this article

Karaata, M., Chaudhuri, P. A self-stabilizing algorithm for bridge finding. Distrib Comput 12, 47–53 (1999). https://doi.org/10.1007/s004460050055

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s004460050055

Search

Navigation