Skip to search formSkip to main contentSkip to account menu

K-minimum spanning tree

Known as: Minimum k-spanning tree 
The k-minimum spanning tree problem, studied in theoretical computer science, asks for a tree of minimum cost that has exactly k vertices and forms a… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
The network design is a planning process of placing system components to provide service or meet certain needs in an economical… 
2014
2014
Overlay routing has emerged as a promising approach to improve reliability and efficiency of the Internet. However, deploying a… 
2012
2012
A combinatorial optimization problem, namely kMinimum Spanning Tree Problem, is to find a subtree with exactly k edges in an… 
1984
1984
This report studies the statistical behavior of some parameters defined in a graph, such as are used in pattern recognition and…