Distributed Algorithms for Minimum Degree Spanning Trees
arXiv: Data Structures and Algorithms, Volume abs/1806.03365, 2018.
The minimum degree spanning tree (MDST) problem requires the construction of a spanning tree $T$ for graph $G=(V,E)$ with $n$ vertices, such that the maximum degree $d$ of $T$ is the smallest among all spanning trees of $G$. In this paper, we present two new distributed approximation algorithms for the MDST problem. Our first result is a ...More
Full Text (Upload PDF)
PPT (Upload PPT)