Load Balanced Spanning Tree (LBST)
Input: An undirected graph G = (V,E) and number k.
Output: Determine if there is a spanning tree (V,T) of G with the property that for each vertex v there are at most k edges in T incident to v. If there is such a spanning tree report it. We call such a tree a spanning tree of degree k.