Self-stabilizing algorithms for finding centers and medians of trees

. The problem of locating centers and medians of graphs has a variety of applicationsin the areas of transportation and communication in distributed systems. This paper presents simpleself-stabilizing algorithms for locating centers and medians of trees. Since the algorithms are selfstabilizingthey can tolerate transient failures as well as a dynamically changing tree topology. Afterthe presentation of the algorithms, the correctness of the algorithms is proven and upper bounds ontheir...