A self-stabilizing algorithm for finding weighted centroid in trees
A self-stabilizing algorithm for finding weighted centroid in trees
复制标题
一种寻找树中加权质心的自稳定算法
DOI：
10.2478/v10065-012-0035-x
复制
发表时间：
2012
期刊：
影响因子：
--
通讯作者：
M. Panczyk
中科院分区：
文献类型：
--
作者：
H. Bielak;M. Panczyk
In this paper we present some modification of the Blair and Manne algorithm for finding the center of a tree network in the distributed, self-stabilizing environment. Their algorithm finds n/2 -separator of a tree. Our algorithm finds weighted centroid, which is direct generalization of the former one for tree networks with positive weights on nodes. Time complexity of both algorithms is O(n2), where n is the number of nodes in the network.
