Undirected, Planar MST: Difference between revisions
Jump to navigation
Jump to search
(Created page with "{{DISPLAYTITLE:Undirected, Planar 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 graph is planar. == Related Problems == Generalizations: Undirected, General MST Related: Undirected, Dense...") |
No edit summary |
||
| Line 12: | Line 12: | ||
== Parameters == | == Parameters == | ||
V: number of vertices | |||
E: number of edges | E: number of edges | ||
U: maximum edge weight | |||
U: maximum edge weight | |||
== Table of Algorithms == | == Table of Algorithms == | ||
Revision as of 12:02, 15 February 2023
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 graph is planar.
Related Problems
Generalizations: Undirected, General MST
Related: Undirected, Dense MST, Undirected, Integer Weights 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 |
|---|---|---|---|---|---|---|
| Cheriton-Tarjan (planar) | 1976 | $O(V)$ | $O(V)$ auxiliary | Exact | Deterministic | Time |