Keywords

#k-minimum_spanning_tree

K-minimum 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 subgraph of a larger graph. It is also called the k-MST or edge-weighted k-cardinality tree. Finding this tree is NP-hard, but it can be approximated to within a constant approximation ratio in polynomial time.

Mon 29th

Provided by Wikipedia

Learn More

This keyword could refer to multiple things. Here are some suggestions:

Minimum spanning tree K-minimum spanning tree Spanning tree Euclidean minimum spanning tree Minimum bottleneck spanning tree Minimum degree spanning tree Rectilinear minimum spanning tree Kinetic minimum spanning tree Minimum routing cost spanning tree Spanning tree (disambiguation)
0 searches
This keyword has never been searched before
This keyword has never been searched for with any other keyword.