A Simple Deterministic Distributed Low-Diameter Clustering

10/21/2022

∙

by   Václav Rozhoň, et al.

∙

0

∙

share

We give a simple, local process for nodes in an undirected graph to form non-adjacent clusters that (1) have at most a polylogarithmic diameter and (2) contain at least half of all vertices. Efficient deterministic distributed clustering algorithms for computing strong-diameter network decompositions and other key tools follow immediately. Overall, our process is a direct and drastically simplified way for computing these fundamental objects.