Undirected, Integer Weights MST (Minimum Spanning Tree (MST))

From Algorithm Wiki
Jump to navigation Jump to search


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. Here, we assume that the edges have integer weights, represented in binary.

Related Problems

Generalizations: Undirected, General MST

Related: Undirected, Dense MST, Undirected, Planar MST, Directed (Optimum Branchings), General MST, Directed (Optimum Branchings), Super Dense MST


$V$: number of vertices

$E$: number of edges

$U$: maximum edge weight

Table of Algorithms

Name Year Time Space Approximation Factor Model Reference
Fredman & Willard 1991 $O(E+V)$ Exact Deterministic Time