= Minimum degree spanning tree
{wiki=Minimum_degree_spanning_tree}
A Minimum Degree Spanning Tree (MDST) is a variation of the Minimum Spanning Tree (MST) problem, which is typically concerned with connecting all vertices in a graph with the minimum possible total edge weight. In the context of an MDST, the objective shifts slightly. In an MDST, the goal is to find a spanning tree that not only minimizes the total edge weight but also limits the maximum degree of any vertex in the tree.
Back to article page
