期刊
SIAM JOURNAL ON COMPUTING
卷 35, 期 1, 页码 120-131出版社
SIAM PUBLICATIONS
DOI: 10.1137/S0097539704441848
关键词
minimum-weight spanning tree; distributed algorithms
We consider a simple model for overlay networks, where all n processes are connected to all other processes, and each message contains at most O(log n) bits. For this model, we present a distributed algorithm which constructs a minimum-weight spanning tree in O( log log n) communication rounds, where in each round any process can send a message to every other process. If message size is Theta(n(epsilon)) for some epsilon > 0, then the number of communication rounds is O(log 1/epsilon).
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据