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 130.240.45.6 (talk) at 09:43, 10 November 2004. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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 [The Minimum Spanning Tree](MST).

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