论文标题
一个简单的确定性分布式低直径集群
A Simple Deterministic Distributed Low-Diameter Clustering
论文作者
论文摘要
我们为无向图中的节点提供了一个简单的局部过程，以形成（1）最多具有多头直径的非粘合簇，并且（2）至少包含所有顶点的一半。有效的确定性分布式聚类算法用于计算强直径网络分解和其他关键工具。总体而言，我们的过程是计算这些基本对象的直接且极大地简化的方法。
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.
