Data structures and algorithms for disjoint set union problems
Zvi Galil, Giuseppe Francesco Italiano · ACM Computing Surveys · 1991
This paper surveys algorithmic techniques and data structures that have been proposed to solve the set union problem and its variants. Their discovery required a new set of algorithmic tools that have proven useful in other areas. Special attention is devoted to recent extensions of the original set union problem, and some effort is made to provide a unifying theoretical framework for this growing body of algorithms.