Highly Influenced

# Data Structures and Algorithms for Disjoint Set Union Problems

@article{Galil1991DataSA, title={Data Structures and Algorithms for Disjoint Set Union Problems}, author={Zvi Galil and Giuseppe F. Italiano}, journal={ACM Comput. Surv.}, year={1991}, volume={23}, pages={319-344} }

- Published 1991 in ACM Comput. Surv.
DOI:10.1145/116873.116878

This paper surveys algorithmic techniques and data structures that have been proposed to solve the set union problem and its \·ariants. 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.

Highly Cited

This paper has 155 citations. REVIEW CITATIONS

#### 3 Figures & Tables

#### Topics

#### Statistics

Citations per Year

#### 156 Citations

Semantic Scholar estimates that this publication has

**156**citations based on the available data.See our **FAQ** for additional information.

Showing 1-10 of 10 references

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential