𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A new data structure for the union-find problem

✍ Scribed by Marek J. Lao

Book ID
113162113
Publisher
Elsevier Science
Year
1979
Tongue
English
Weight
967 KB
Volume
9
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Lower Bounds for the Union–Find and the
Lower Bounds for the Union–Find and the Split–Find Problem on Pointer Machines
✍ Han La PoutrΓ© πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 490 KB

A well-known result of Tarjan states that for all n and m n there exists a sequence of n&1 Union and m Find operations that needs at least 0(m . :(m, n)) execution steps on a pointer machine that satisfies the separation condition. Later the bound was extended to 0(n+m. :(m, n)) for all m and n. In