Union-find with constant time deletions

Lecture Notes in Computer Science

Volumn 3580, Issue , 2005, Pages 78-89

  Alstrup, Stephen ^a   Gørtz, Inge Li ^a   Rauhe, Theis ^a   Thorup, Mikkel ^b   Zwick, Uri ^c  

^a IT UNIVERSITY OF COPENHAGEN   (Denmark)

^b AT AND T LABS RESEARCH   (United States)

^c TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; FUNCTIONS; INVERSE PROBLEMS;

AMORTIZED TIME; FUNCTIONAL INVERSE; UNION-FIND DATA STRUCTURES;

DATA STRUCTURES;

EID: 26444459800     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11523468_7     Document Type: Conference Paper

References (13)

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, 1974.
2. S. Alstrup, A. M. Ben-Amram, and T. Rauhe. Worst-case and amortised optimality in union-find. In Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing (STOC'99), pages 499-506, May 1999.
3. A. M. Ben-Amram and Z. Galil. A generalization of a lower bound technique due to Fredman and Saks. Algorithmica, 30(1)-.34-66, 2001.
4. N. Blum. On the single-operation worst-case time complexity of the disjoint set union problem. SIAM J. Comput., 15(4):1021-1024, 1986.
5. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, 2nd edition, 2001.
6. M. Fredman and M. Saks. The cell probe complexity of dynamic data structures. In Proceedings of the 21st Annual Symposium on Theory of Computing (STOC '89), pages 345-354, New York, May 1989. ACM Association for Computing Machinery.
7. Z. Galil and G. F. Italiano. Data structures and algorithms for disjoint set union problems. ACM Computing Surveys, 23(3):319, Sept. 1991.
8. H. Kaplan, N. Shafrir, and R. E. Tarjan. Union-find with deletions. In Proc. of the 13th ACM-SIAM Symp. On Discrete Mathematics (SODA), pages 19-28, 2002.
9. D. L. Kozen. The Design and Analysis of Algorithms. Springer, Berlin, 1992.
10. R. Seidel and M. Sharir. Top-down analysis of path compression. SIAM J. Comput., 34(3):515-525, 2005.
11. M. Smid. A data structure for the union-find problem having good single-operation complexity. ALCOM: Algorithms Review, Newsletter of the ESPRIT II Basic Research Actions Program Project no. 3075 (ALCOM), 1, 1990.
12. R. E. Tarjan. Efficiency of a good but not linear disjoint set union algorithm. Journal of the ACM, 22:215-225, 1975.
13. R. E. Tarjan and J. van Leeuwen. Worst-case analysis of set union algorithms. Journal of the ACM, 31(2):245-281, Apr. 1984.