Equivalence of two versions

• Reporting version can be easily reduced to the optimization version.

• Optimization version can be reduced to the reporting version by searching. Assume a function LBST(G,k) that returns a spanning tree of degree k if there is one, else returns null.

k := 2;

repeat

T:= LBST(G,k);

if T = null then k := k +1

until not(T = null)

Previous slide

Next slide

Back to first slide

View graphic version