Distributed Minimum Degree Spanning Trees

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, pp. 511-520, 2019.

Cited by: 2|Views18


The minimum degree spanning tree (MDST) problem requires the construction of a spanning tree T for graph G, such that the maximum degree of T is the smallest among all spanning trees of G. Let d be this MDST degree for a given graph. In this paper, we present a randomized distributed approximation algorithm for the MDST problem that const...More



Get fulltext within 24h
Upload PDF

1.Your uploaded documents will be check within 24h, and coins will be credited to your account.

2.As the current system does not support cash withdrawal, you can add staff WeChat (AMxiaomai) to receive it as a red packet.

3.10 coins will be exchanged for 1 yuan.


Upload a single paper

for 5 coins

Wechat's Red Packet

Upload 50 articles

for 280 coins

Wechat's Red Packet

Upload 200 articles

for 1200 coins

Wechat's Red Packet

Upload 500 articles

for 3000 coins

Wechat's Red Packet

Upload 1000 articles

for 7000 coins

Wechat's Red Packet
Your rating :