Linear expected time of a simple union-find algorithm
From MaRDI portal
Publication:1233316
DOI10.1016/0020-0190(76)90061-2zbMath0345.68024MaRDI QIDQ1233316
Publication date: 1976
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(76)90061-2
Related Items
Note on the heights of random recursive trees and random m‐ary search trees, A class of algorithms which require nonlinear time to maintain disjoint sets, A linear-time algorithm for a special case of disjoint set union, Applications of the theory of records in the study of random trees, The expected linearity of a simple equivalence algorithm
Cites Work