A SELF-STABILIZING ALGORITHM FOR FINDING ARTICULATION POINTS
Mehmet Hakan Karaata · International Journal of Foundations of Computer Science · 1999
In this paper, a self-stabilizing algorithm is presented for finding the articulation points of a connected undirected graph on a distributed or network model of computation after O(n2|E|) moves. The algorithm is resilient to transient faults and does not require initialization. A correctness proof of the algorithm is also presented. The paper concludes with remarks on issues such as the time complexity of the algorithm and open problems.