Undirected, Integer Weights MST (Minimum Spanning Tree (MST))
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.
Generalizations: Undirected, General MST
$V$: number of vertices
$E$: number of edges
$U$: maximum edge weight
Table of Algorithms
|Fredman & Willard||1991||$O(E+V)$||Exact||Deterministic||Time|