A Stabilizing Algorithm for Finding Bico
β
Mehmet Hakan Karaata
π
Article
π
2002
π
Elsevier Science
π
English
β 209 KB
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