Self-Stabilizing Algorithms for Finding Centers and Medians of Trees

Locating a center or a median in a graph is a fundamental graph-theoretic problem. Centers and medians are especially important in distributed systems because they are ideal locations for placing resources that need to be shared among different processes in a network. This paper presents simple self...

Full description

Saved in:
Bibliographic Details
Published in:SIAM journal on computing 1999, Vol.29 (2), p.600-614
Main Authors: Bruell, Steven C., Ghosh, Sukumar, Karaata, Mehmet Hakan, Pemmaraju, Sriram V.
Format: Article
Language:English
Subjects:
Algorithms
Graphs
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Locating a center or a median in a graph is a fundamental graph-theoretic problem. Centers and medians are especially important in distributed systems because they are ideal locations for placing resources that need to be shared among different processes in a network. This paper presents simple self-stabilizing algorithms for locating centers and medians of trees. Since these algorithms are self-stabilizing, they can tolerate transient failures. In addition, they can automatically adjust to a dynamically changing tree topology. After the algorithms are presented, their correctness is proven and upper bounds on their time complexity are established. Finally, extensions of our algorithms to trees with arbitrary, positive edge costs are sketched.
ISSN:0097-5397
1095-7111
DOI:10.1137/S0097539798427156