Distributed algorithms for locating centers and medians in communication networks
Mohan B. Sharma, Jianhua Chen, S. S. Iyengar · 1992
Problems of finding distributively, the centers and medians of asynchronous communication networks are considered, and efficient distributed algorithms for determining these parameters are presented.The princip81 results of this paper are: 3.Finally, we present extensions of ~ese algorithms for weighted trees.