A Stabilizing Algorithm for Finding Biconnected Components

In this paper, a self-stabilizing algorithm is presented for finding biconnected components of a connected undirected graph on a distributed or network model of computation. The algorithm is resilient to transient faults, therefore, it does not require initialization. The proposed algorithm is based on stabilizing BFS construction and bridge-finding algorithms. Upon termination of these algorithms, the proposed algorithm terminates after OðdÞ rounds, where d is the diameter of the biconnected component with the largest diameter in the graph. The paper concludes with remarks on issues such as the adaptiveness of the algorithm. # 2002 Elsevier Science (USA)