A minimum spanning tree (MST) or minimum weight spanning tree is a subset of the edges of a connected, edge-weighted undirected graph that connects all...

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

A Euclidean minimum spanning tree of a finite set of points in the Euclidean plane or higher-dimensional Euclidean space connects the points by a system...

weighted edge in a spanning tree. A spanning tree is a minimum bottleneck spanning tree if the graph does not contain a spanning tree with a smaller bottleneck...

on spanning trees have also been studied, including the maximum spanning tree, the minimum tree that spans at least k vertices, the spanning tree with...

containing spanning tree Minimum spanning tree Capacitated minimum spanning tree Distributed minimum spanning tree Euclidean minimum spanning tree k-minimum spanning...

and computational geometry, a minimum-diameter spanning tree of a finite set of points in a metric space is a spanning tree in which the diameter (the longest...

rectilinear minimum spanning tree (RMST) of a set of n points in the plane (or more generally, in R d {\displaystyle \mathbb {R} ^{d}} ) is a minimum spanning tree...

degree greater than k? This is also known as the degree-constrained spanning tree problem. Finding the minimum degree spanning tree of an undirected graph...

A kinetic minimum spanning tree is a kinetic data structure that maintains the minimum spanning tree (MST) of a graph whose edge weights are changing as...

tree problem in graphs is equivalent to the minimum spanning tree. However, while both the non-negative shortest path and the minimum spanning tree problem...

distance spanning tree, shortest total path length spanning tree, minimum total distance spanning tree, or minimum average distance spanning tree. In an...

Capacitated minimum spanning tree is a minimal cost spanning tree of a graph that has a designated root node r {\displaystyle r} and satisfies the capacity...

In graph theory a minimum spanning tree (MST) T {\displaystyle T} of a graph G = ( V , E ) {\displaystyle G=(V,E)} with | V | = n {\displaystyle |V|=n}...

degree-constrained spanning tree is a spanning tree where the maximum vertex degree is limited to a certain constant k. The degree-constrained spanning tree problem...

constructing dynamic-programming based separation oracles. In a minimum-cost spanning-tree game, each player is a node in a complete graph. The graph contains...

augmented trees and maximal pseudoforests are also sometimes called augmented forests. The minimum spanning pseudoforest problem involves finding a spanning pseudoforest...

endpoints of the network edges, then the shortest network is their minimum spanning tree. However, shorter networks can often be obtained by adding Steiner...

finding a spanning arborescence of minimum weight (sometimes called an optimum branching). It is the directed analog of the minimum spanning tree problem...

domination number of G is the number of vertices in the minimum connected dominating set. Any spanning tree T of a graph G has at least two leaves, vertices...

algorithm is a greedy algorithm for finding a minimum spanning tree in a graph, or a minimum spanning forest in the case of a graph that is not connected...

Maunder Minimum". It occurred before sunspots had been directly observed and was discovered instead by analysis of the proportion of carbon-14 in tree rings...

in the OEIS). Finding a spanning caterpillar in a graph is NP-complete. A related optimization problem is the Minimum Spanning Caterpillar Problem (MSCP)...

topological minors Steiner tree, or Minimum spanning tree for a subset of the vertices of a graph. (The minimum spanning tree for an entire graph is solvable...

in Kruskal's algorithm for finding the minimum spanning tree of a graph. The importance of minimum spanning trees means that disjoint-set data structures...

unproven conjecture on the ratio of lengths of Steiner trees and Euclidean minimum spanning trees for the same point sets in the Euclidean plane. It was...

parametric minimum spanning tree problem is Ω ( n log ⁡ k ) {\displaystyle \Omega (n\log k)} , a weaker bound than that for the k {\displaystyle k} -set problem...

minimax path weight in the minimum spanning tree of the metric. From the minimum spanning tree, one can construct a Cartesian tree, the root node of which...

set and a uniform spanning tree of a graph is a spanning tree selected with uniform probabilities from the full set of spanning trees of the graph. The...

in which the tree structure of the walls forms a spanning tree of the graph and the tree structure of the free space forms a spanning tree of the dual...