Jump to content

K-minimum spanning tree

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Cronholm144 (talk | contribs) at 00:42, 14 June 2007 (clean up and add/rm math rating template using AWB). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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.

Stub icon

This combinatorics-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=K-minimum_spanning_tree&oldid=138030425"