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 Timo Honkasalo (talk | contribs) at 10:13, 10 November 2004. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
The correct title of this article is k-minimum spanning tree. It appears incorrectly here due to technical restrictions.

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).

This 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=7301597"