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}
}
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. 

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper

Citations

Publications citing this paper.
SHOWING 1-10 OF 92 CITATIONS, ESTIMATED 25% COVERAGE

92 Citations

05'91'97'04'11'18
Citations per Year
Semantic Scholar estimates that this publication has 92 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
SHOWING 1-10 OF 11 REFERENCES

~vI-depth :-;t'arC"il ill branch and bound algorithms

  • T. IBARAKI
  • Int. J. Compul Inform. Sci. 7, pp. 313-373.
  • 1978
Highly Influential
4 Excerpts

A:-':D ULDL\:-'

  • A. V. AHO, HOPCROFT, E J.
  • J. D
  • 1974
Highly Influential
4 Excerpts

The Art of Computer Programming

  • E.D.
  • Vol. 3: Sorting and Searching. Addison-Wesley…
  • 1973
Highly Influential
9 Excerpts

Similar Papers

Loading similar papers…