Degree-Constrained -Minimum Spanning Tree Problem

Figure 1

An input complete graph instance with feasible solutions for the DCMST problem while using degree values of 3 and 2, respectively: (a) complete graph instance composed of 10 nodes with random uniform costs; (b) feasible solution with node degree values of at most 3; (c) feasible solution with node degree values of at most 2.

(a)

(b)

(c)