Construct · 1 fields · 1 citations

minimum spanning tree: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed
minimumspanning tree1 CONSTRUCTMinimum spanning treeKRUSKAL · ALGORITHMS AND DATA

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Algorithms and data structures

a subset of a weighted graph's edges that connects all vertices without cycles at the lowest total weight, with a greedy algorithm to find it.

In algorithms and data structures, minimum spanning tree refers to a subset of a weighted graph's edges that connects all vertices without cycles at the lowest total weight, with a greedy algorithm to find it. This meaning comes from Kruskal (1956) in Proceedings of the American Mathematical Society.[1]

Unit
Recovery means
Measured by

Next

Run it through the Collider, or take the citations with you.

See how minimum spanning tree sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in ColliderExport BibTeXReport this entry

Nearby constructs

greedy algorithm1 fields · 1 citationsanchor · one construct, one fieldtree3 fields · 4 citationsjingle · one word, three constructsweight4 fields · 4 citationsjingle · one word, four constructs

References

  1. Kruskal, J. B. (1956). On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society, 7(1), 48-50. https://doi.org/10.1090/s0002-9939-1956-0078686-7

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct