Optimization Version of LBST

• Input: An undirected graph G = (V,E).

• Output: A number k and a spanning tree (V,T) of degree k. Furthermore, there is no spanning tree of degree < k.

Previous slide

Next slide

Back to first slide

View graphic version