K-minimum spanning tree

Encyclopedia : K : KM : KMI : K-minimum spanning tree

In mathematics, the K-minimum spanning tree is a graph G that spans 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).

From Wikipedia, the Free Encyclopedia. Original article here. Support Wikipedia by contributing or donating.
All text is available under the terms of the GNU Free Documentation License See Wikipedia Copyrights for details.