Construct · 1 fields · 1 citations

union-find: a standalone construct

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

● anchor · a standalone construct Nearest construct by meaning·not indexed
union-find1 CONSTRUCTUnion-findTARJAN · 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 structure that maintains a partition of elements under merge and find operations, whose cost with path compression grows as the inverse Ackermann function.

In algorithms and data structures, union-find refers to a structure that maintains a partition of elements under merge and find operations, whose cost with path compression grows as the inverse Ackermann function. This meaning comes from Tarjan (1975) in Journal of the ACM.[1]

Unit
Recovery means
Measured by

Next

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

See how union-find 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

compression4 fields · 5 citationsjingle · one word, four kinds of squeezecost4 fields · 4 citationsjingle · one word, four constructsfunction5 fields · 6 citationsjingle · one word, five constructs

References

  1. Tarjan, R. E. (1975). Efficiency of a Good But Not Linear Set Union Algorithm. Journal of the ACM, 22(2), 215-225. https://doi.org/10.1145/321879.321884

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