Minimum spanning tree

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 vertices together, without any cycles and with the minimum possible total edge weight. That is, it is a spanning tree whose sum of edge weights is as small as possible. More generally, any edge-weighted undirected graph (not necessarily connected) has a minimum spanning forest, which is a union of the minimum spanning trees for its connected components.

There are many use cases for minimum spanning trees. One example is a telecommunications company trying to lay cable in a new neighborhood. If it is constrained to bury the cable only along certain paths (e.g. roads), then there would be a graph containing the points (e.g. houses) connected by those paths. Some of the paths might be more expensive, because they are longer, or require the cable to be buried deeper; these paths would be represented by edges with larger weights. Currency is an acceptable unit for edge weight – there is no requirement for edge lengths to obey normal rules of geometry such as the triangle inequality. A spanning tree for that graph would be a subset of those paths that has no cycles but still connects every house; there might be several spanning trees possible. A minimum spanning tree would be one with the lowest total cost, representing the least expensive path for laying the cable.

Possible multiplicity
If there are $n$ vertices in the graph, then each spanning tree has $n − 1$ edges.

There may be several minimum spanning trees of the same weight; in particular, if all the edge weights of a given graph are the same, then every spanning tree of that graph is minimum.

Uniqueness
If each edge has a distinct weight then there will be only one, unique minimum spanning tree. This is true in many realistic situations, such as the telecommunications company example above, where it's unlikely any two paths have exactly the same cost. This generalizes to spanning forests as well.

Proof:
 * 1) Assume the contrary, that there are two different MSTs $A$ and $B$.
 * 2) Since $A$ and $B$ differ despite containing the same nodes, there is at least one edge that belongs to one but not the other.  Among such edges, let $e1$ be the one with least weight; this choice is unique because the edge weights are all distinct.  Without loss of generality, assume $e1$ is in $A$.
 * 3) As $B$ is an MST, ${e1} ∪ B$ must contain a cycle $C$ with $e1$.
 * 4) As a tree, $A$ contains no cycles, therefore $C$ must have an edge $e2$ that is not in $A$.
 * 5) Since $e1$ was chosen as the unique lowest-weight edge among those belonging to exactly one of $A$ and $B$, the weight of $e2$ must be greater than the weight of $e1$.
 * 6) As $e1$ and $e2$ are part of the cycle $C$, replacing $e2$ with $e1$ in $B$ therefore yields a spanning tree with a smaller weight.
 * 7) This contradicts the assumption that $B$ is an MST.

More generally, if the edge weights are not all distinct then only the (multi-)set of weights in minimum spanning trees is certain to be unique; it is the same for all minimum spanning trees.

Minimum-cost subgraph
If the weights are positive, then a minimum spanning tree is, in fact, a minimum-cost subgraph connecting all vertices, since if a subgraph contains a cycle, removing any edge along that cycle will decrease its cost and preserve connectivity.

Cycle property
For any cycle $C$ in the graph, if the weight of an edge $e$ of $C$ is larger than any of the individual weights of all other edges of $C$, then this edge cannot belong to an MST.

Proof: Assume the contrary, i.e. that $e$ belongs to an MST $T1$. Then deleting $e$ will break $T1$ into two subtrees with the two ends of $e$ in different subtrees. The remainder of $C$ reconnects the subtrees, hence there is an edge $f$ of $C$ with ends in different subtrees, i.e., it reconnects the subtrees into a tree $T2$ with weight less than that of $T1$, because the weight of $f$ is less than the weight of $e$.

Cut property


For any cut $T$ of the graph, if the weight of an edge $BC$ in the cut-set of $EC$ is strictly smaller than the weights of all other edges of the cut-set of $EF$, then this edge belongs to all MSTs of the graph.

Proof: Assume that there is an MST $T$ that does not contain $C$. Adding $e$ to $C$ will produce a cycle, that crosses the cut once at $C$ and crosses back at another edge $T$. Deleting $e$ we get a spanning tree $S = {A,B,D,E},$ of strictly smaller weight than $e$. This contradicts the assumption that $T$ was a MST.

By a similar argument, if more than one edge is of minimum weight across a cut, then each such edge is contained in some minimum spanning tree.

Minimum-cost edge
If the minimum cost edge $e$ of a graph is unique, then this edge is included in any MST.

Proof: if $e'$ was not included in the MST, removing any of the (larger cost) edges in the cycle formed after adding $e'$ to the MST, would yield a spanning tree of smaller weight.

Contraction
If $T$ is a tree of MST edges, then we can contract $T$ into a single vertex while maintaining the invariant that the MST of the contracted graph plus $e$ gives the MST for the graph before contraction.

Algorithms
In all of the algorithms below, $e$ is the number of edges in the graph and $e$ is the number of vertices.

Classic algorithms
The first algorithm for finding a minimum spanning tree was developed by Czech scientist Otakar Borůvka in 1926 (see Borůvka's algorithm). Its purpose was an efficient electrical coverage of Moravia. The algorithm proceeds in a sequence of stages. In each stage, called Boruvka step, it identifies a forest $T$ consisting of the minimum-weight edge incident to each vertex in the graph $T$, then forms the graph $V – S = {C,F},$ as the input to the next step. Here $(S, V – S)$ denotes the graph derived from $T$ by contracting edges in $m$ (by the Cut property, these edges belong to the MST). Each Boruvka step takes linear time. Since the number of vertices is reduced by at least half in each step, Boruvka's algorithm takes $S ∪ {e}$ time.

A second algorithm is Prim's algorithm, which was invented by Vojtěch Jarník in 1930 and rediscovered by Prim in 1957 and Dijkstra in 1959. Basically, it grows the MST ($n$) one edge at a time. Initially, $F$ contains an arbitrary vertex. In each step, $G$ is augmented with a least-weight edge $T∖{e' } ∪ {e}$ such that $G$ is in $F$ and $T$ is not yet in $T$. By the Cut property, all edges added to $T$ are in the MST. Its run-time is either $G1 = G \ F$ or $G \ F$, depending on the data-structures used.

A third algorithm commonly in use is Kruskal's algorithm, which also takes $O(m log n)$ time.

A fourth algorithm, not as commonly used, is the reverse-delete algorithm, which is the reverse of Kruskal's algorithm. Its runtime is $(x,y)$.

All four of these are greedy algorithms. Since they run in polynomial time, the problem of finding such trees is in FP, and related decision problems such as determining whether a particular edge is in the MST or determining if the minimum total weight exceeds a certain value are in P.

Faster algorithms
Several researchers have tried to find more computationally-efficient algorithms.

In a comparison model, in which the only allowed operations on edge weights are pairwise comparisons, found a linear time randomized algorithm based on a combination of Borůvka's algorithm and the reverse-delete algorithm.

The fastest non-randomized comparison-based algorithm with known complexity, by Bernard Chazelle, is based on the soft heap, an approximate priority queue. Its running time is $O(m log n)$, where $O(m + n log n)$ is the classical functional inverse of the Ackermann function. The function $O(m log n)$ grows extremely slowly, so that for all practical purposes it may be considered a constant no greater than 4; thus Chazelle's algorithm takes very close to linear time.

Dense graphs
If the graph is dense (i.e. $O(m log n (log log n)3)$, then a deterministic algorithm by Fredman and Tarjan finds the MST in time $O(m α(m,n))$. The algorithm executes a number of phases. Each phase executes Prim's algorithm many times, each for a limited number of steps. The run-time of each phase is $α$. If the number of vertices before a phase is $x$, the number of vertices remaining after a phase is at most $$\tfrac{n'}{2^{m/n'}}$$. Hence, at most $α$ phases are needed, which gives a linear run-time for dense graphs.

There are other algorithms that work in linear time on dense graphs.

Integer weights
If the edge weights are integers represented in binary, then deterministic algorithms are known that solve the problem in $m/n ≥ log log log n)$ integer operations. Whether the problem can be solved deterministically for a general graph in linear time by a comparison-based algorithm remains an open question.

Decision trees
Given graph $T$ where the nodes and edges are fixed but the weights are unknown, it is possible to construct a binary decision tree (DT) for calculating the MST for any permutation of weights. Each internal node of the DT contains a comparison between two edges, e.g. "Is the weight of the edge between $y$ and $T$ larger than the weight of the edge between $T$ and $n'$?". The two children of the node correspond to the two possible answers "yes" or "no". In each leaf of the DT, there is a list of edges from $G$ that correspond to an MST. The runtime complexity of a DT is the largest number of queries required to find the MST, which is just the depth of the DT. A DT for a graph $x$ is called optimal if it has the smallest depth of all correct DTs for $y$.

For every integer $w$, it is possible to find optimal decision trees for all graphs on $z$ vertices by brute-force search. This search proceeds in two steps.

A. Generating all potential DTs
 * There are $$2^{r \choose 2}$$ different graphs on $G$ vertices.
 * For each graph, an MST can always be found using $O(m)$ comparisons, e.g. by Prim's algorithm.
 * Hence, the depth of an optimal DT is less than $O(m + n)$.
 * Hence, the number of internal nodes in an optimal DT is less than $$2^{r^2}$$.
 * Every internal node compares two edges. The number of edges is at most $log*n$ so the different number of comparisons is at most $O(m + n)$.
 * Hence, the number of potential DTs is less than

$${(r^4)}^{(2^{r^2})} = r^{2^{(r^2+2)}}.$$

B. Identifying the correct DTs To check if a DT is correct, it should be checked on all possible permutations of the edge weights.
 * The number of such permutations is at most $r(r – 1)$.
 * For each permutation, solve the MST problem on the given graph using any existing algorithm, and compare the result to the answer given by the DT.
 * The running time of any MST algorithm is at most $r2$, so the total time required to check all permutations is at most $r2$.

Hence, the total time required for finding an optimal DT for all graphs with $G$ vertices is:
 * $$2^{r \choose 2} \cdot r^{2^{(r^2+2)}} \cdot (r^2+1)!,$$

which is less than
 * $$2^{2^{r^2+o(r)}}.$$

Optimal algorithm
Seth Pettie and Vijaya Ramachandran have found a provably optimal deterministic comparison-based minimum spanning tree algorithm. The following is a simplified description of the algorithm.


 * 1) Let $r4$, where $G$ is the number of vertices. Find all optimal decision trees on $r$ vertices. This can be done in time $(r2)!$ (see Decision trees above).
 * 2) Partition the graph to components with at most $r$ vertices in each component. This partition uses a soft heap, which "corrupts" a small number of the edges of the graph.
 * 3) Use the optimal decision trees to find an MST for the uncorrupted subgraph within each component.
 * 4) Contract each connected component spanned by the MSTs to a single vertex, and apply any algorithm which works on dense graphs in time $r2$ to the contraction of the uncorrupted subgraph
 * 5) Add back the corrupted edges to the resulting forest to form a subgraph guaranteed to contain the minimum spanning tree, and smaller by a constant factor than the starting graph. Apply the optimal algorithm recursively to this graph.

The runtime of all steps in the algorithm is $(r2 + 1)!$, except for the step of using the decision trees. The runtime of this step is unknown, but it has been proved that it is optimal - no algorithm can do better than the optimal decision tree. Thus, this algorithm has the peculiar property that it is provably optimal although its runtime complexity is unknown.

Parallel and distributed algorithms
Research has also considered parallel algorithms for the minimum spanning tree problem. With a linear number of processors it is possible to solve the problem in $r = log log log n$ time.

The problem can also be approached in a distributed manner. If each node is considered a computer and no node knows anything except its own connected links, one can still calculate the distributed minimum spanning tree.

MST on complete graphs with random weights
Alan M. Frieze showed that given a complete graph on n vertices, with edge weights that are independent identically distributed random variables with distribution function $$F$$ satisfying $$F'(0) > 0$$, then as n approaches +∞ the expected weight of the MST approaches $$\zeta(3)/F'(0)$$, where $$\zeta$$ is the Riemann zeta function (more specifically is $$\zeta(3)$$ Apéry's constant). Frieze and Steele also proved convergence in probability. Svante Janson proved a central limit theorem for weight of the MST.

For uniform random weights in $$[0,1]$$, the exact expected size of the minimum spanning tree has been computed for small complete graphs.

Fractional variant
There is a fractional variant of the MST, in which each edge is allowed to appear "fractionally". Formally, a fractional spanning set of a graph (V,E) is a nonnegative function f on E such that, for every non-trivial subset W of V (i.e., W is neither empty nor equal to V), the sum of f(e) over all edges connecting a node of W with a node of V\W is at least 1. Intuitively, f(e) represents the fraction of e that is contained in the spanning set. A minimum fractional spanning set is a fractional spanning set for which the sum $$\sum_{e\in E} f(e)\cdot w(e)$$ is as small as possible.

If the fractions f(e) are forced to be in {0,1}, then the set T of edges with f(e)=1 are a spanning set, as every node or subset of nodes is connected to the rest of the graph by at least one edge of T. Moreover, if f minimizes$$\sum_{e\in E} f(e)\cdot w(e)$$, then the resulting spanning set is necessarily a tree, since if it contained a cycle, then an edge could be removed without affecting the spanning condition. So the minimum fractional spanning set problem is a relaxation of the MST problem, and can also be called the fractional MST problem.

The fractional MST problem can be solved in polynomial time using the ellipsoid method. However, if we add a requirement that f(e) must be half-integer (that is, f(e) must be in {0, 1/2, 1}), then the problem becomes NP-hard, since it includes as a special case the Hamiltonian cycle problem: in an $$n$$-vertex unweighted graph, a half-integer MST of weight $$n/2$$ can only be obtained by assigning weight 1/2 to each edge of a Hamiltonian cycle.

Other variants

 * The Steiner tree of a subset of the vertices is the minimum tree that spans the given subset. Finding the Steiner tree is NP-Complete.


 * The k-minimum spanning tree (k-MST) is the tree that spans some subset of k vertices in the graph with minimum weight.
 * A set of k-smallest spanning trees is a subset of k spanning trees (out of all possible spanning trees) such that no spanning tree outside the subset has smaller weight.   (Note that this problem is unrelated to the k-minimum spanning tree.)
 * The Euclidean minimum spanning tree is a spanning tree of a graph with edge weights corresponding to the Euclidean distance between vertices which are points in the plane (or space).
 * The rectilinear minimum spanning tree is a spanning tree of a graph with edge weights corresponding to the rectilinear distance between vertices which are points in the plane (or space).
 * The distributed minimum spanning tree is an extension of MST to the distributed model, where each node is considered a computer and no node knows anything except its own connected links. The mathematical definition of the problem is the same but there are different approaches for a solution.
 * The capacitated minimum spanning tree is a tree that has a marked node (origin, or root) and each of the subtrees attached to the node contains no more than c nodes. c is called a tree capacity. Solving CMST optimally is NP-hard, but good heuristics such as Esau-Williams and Sharma produce solutions close to optimal in polynomial time.
 * The degree-constrained minimum spanning tree is a MST in which each vertex is connected to no more than d other vertices, for some given number d. The case d = 2 is a special case of the traveling salesman problem, so the degree constrained minimum spanning tree is NP-hard in general.
 * An arborescence is a variant of MST for directed graphs. It can be solved in $$O(E + V \log V)$$ time using the Chu–Liu/Edmonds algorithm.
 * A maximum spanning tree is a spanning tree with weight greater than or equal to the weight of every other spanning tree. Such a tree can be found with algorithms such as Prim's or Kruskal's after multiplying the edge weights by -1 and solving the MST problem on the new graph. A path in the maximum spanning tree is the widest path in the graph between its two endpoints: among all possible paths, it maximizes the weight of the minimum-weight edge. Maximum spanning trees find applications in parsing algorithms for natural languages and in training algorithms for conditional random fields.
 * The dynamic MST problem concerns the update of a previously computed MST after an edge weight change in the original graph or the insertion/deletion of a vertex.
 * The minimum labeling spanning tree problem is to find a spanning tree with least types of labels if each edge in a graph is associated with a label from a finite label set instead of a weight.
 * A bottleneck edge is the highest weighted edge in a spanning tree. A spanning tree is a minimum bottleneck spanning tree (or MBST) if the graph does not contain a spanning tree with a smaller bottleneck edge weight. A MST is necessarily a MBST (provable by the cut property), but a MBST is not necessarily a MST.
 * A minimum-cost spanning tree game is a cooperative game in which the players have to share among them the costs of constructing the optimal spanning tree.
 * The optimal network design problem is the problem of computing a set, subject to a budget constraint, which contains a spanning tree, such that the sum of shortest paths between every pair of nodes is as small as possible.

Applications
Minimum spanning trees have direct applications in the design of networks, including computer networks, telecommunications networks, transportation networks, water supply networks, and electrical grids (which they were first invented for, as mentioned above). They are invoked as subroutines in algorithms for other problems, including the Christofides algorithm for approximating the traveling salesman problem, approximating the multi-terminal minimum cut problem (which is equivalent in the single-terminal case to the maximum flow problem), and approximating the minimum-cost weighted perfect matching.

Other practical applications based on minimal spanning trees include:
 * Taxonomy.
 * Cluster analysis: clustering points in the plane, single-linkage clustering (a method of hierarchical clustering), graph-theoretic clustering, and clustering gene expression data.
 * Constructing trees for broadcasting in computer networks.
 * Image registration and segmentation – see minimum spanning tree-based segmentation.
 * Curvilinear feature extraction in computer vision.
 * Handwriting recognition of mathematical expressions.
 * Circuit design: implementing efficient multiple constant multiplications, as used in finite impulse response filters.
 * Regionalisation of socio-geographic areas, the grouping of areas into homogeneous, contiguous regions.
 * Comparing ecotoxicology data.
 * Topological observability in power systems.
 * Measuring homogeneity of two-dimensional materials.
 * Minimax process control.
 * Minimum spanning trees can also be used to describe financial markets. A correlation matrix can be created by calculating a coefficient of correlation between any two stocks. This matrix can be represented topologically as a complex network and a minimum spanning tree can be constructed to visualize relationships.