In mathematics, the K-minimum spanning tree is a graph G that spanns some K of N vertices in the input set S with the minimum total length. K is less than or equal to n. The K-MST does not have to be a subgraph of the minimum spanning tree (MST).
