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 Oleg Alexandrov (talk | contribs) at 20:25, 4 April 2005 ("Spelling. This is a semi-automatic update (software suggests changes and user decides). It is likely this bot did not fix all spelling mistakes in this article."). 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).

Stub icon

This mathematics-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=16912066"