A self-stabilizing algorithm for the center-finding problem assuming read/write separate atomicity

The problem of locating centers of graphs has a variety of applications in the areasof transportation and communication in distributed systems. In this paper, we design and prove the correctness of a self-stabilizing algorithm which finds the center(s) for a distributed system with a tree topology. The computational model employed in this paper was introduced by Dolev et al., which assumes the read/write separate atomicity.