Given a connected, undirected graph G whose edges are labeled (or colored), the minimum labeling spanning tree (MLST) problem seeks a spanning tree on G with the minimum number of distinct labels (or ...

The Minimum Spanning Tree (MST) is of crucial importance for Communication Networks (CNs), which can solve problems of unconstrained CNs effectively. However, in practical CNs, the degree of the ...