K-minimum spanning tree

From Wikipedia, the free encyclopedia

You have new messages (last change).

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). This problem is also known as Edge-Weighted K-Cardinality Tree (KCT). Refer to KCTLIB for more information. This problem is known to be NP-complete.

[edit] External links

This combinatorics-related article is a stub. You can help Wikipedia by expanding it.
Retrieved from "http://en.wikipedia.org../../../k/-/m/K-minimum_spanning_tree.html"