Undirected, Integer Weights MST (Minimum Spanning Tree (MST))
Revision as of 11:19, 15 February 2023 by Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Undirected, Integer Weights MST (Minimum Spanning Tree (MST))}} == Description == 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,...")
Description
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
Parameters
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 |
References/Citation
https://www.sciencedirect.com/science/article/pii/S0022000005800649?via%3Dihub