Caron, E.; Datta, A.K.; Depardon, B.; Larmore, L.L.; Laboratoire de l'informatique du parallélisme
(LIP, 2008-09)
(ENG) A self-stabilizing asynchronous distributed algorithm is given for constructing a k-dominating set, and hence a k-clustering, of a connected network of
processes with unique IDs and weighted edges. The algorithm is ...