• Encyclopaedia
• K
• K-
• K-a
• K-b
• K-c
• K-d
• K-e
• K-f
• K-g
• K-h
• K-i
• K-j
• K-k
• K-l
• K-m
• K-n
• K-o
• K-p
• K-q
• K-r
• K-s
• K-t
• K-u
• K-v
• K-w
• K-x
• K-y
• K-z

K-minimum spanning tree

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 mathematics-related article is a stub. You can help Wikipedia by expanding it.

Categories: Mathematics stubs | Graph theory

Content is distributed under the GNU Free Documentation License.