Union-find with deletions

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 06-08-January-2002, Issue , 2002, Pages 19-28

  Kaplan, Haim ^a   Shafrir, Nira ^a   Tarjan, Robert E ^b,c  

^a TEL AVIV UNIVERSITY   (Israel)

^b Princeton University   (United States)

^c Intertrust Technologies Corporation   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COSTS; DATA STRUCTURES;

ACKERMANN'S FUNCTIONS; CONSTANT FACTORS; DISJOINT SETS; TIME BOUND; UNION FIND; UNION-FIND DATA STRUCTURES; UNION-FIND PROBLEMS; WORST-CASE PERFORMANCE;

COST BENEFIT ANALYSIS;

EID: 84968815902     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (9)

1. A. M. Ben-Amram and Z. Galil. A generalization of a lower bound technique due to Fredman and Saks. Algorithmica, 30:34-66, 2001.
2. N. Blum. On the single-operation worst-case time complexity of the disjoint set union problem. SIAM J. Computing, 15(4):1021-1024, 1985.
3. M. L. Fredman and M. E. Saks. The cell probe complexity of dynamic data structures. In Proc. 21st ACM Symposium on Theory of Computing, pages 345-354, 1989.
4. M. L. Fredman and R. E. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM, 34(3):596-615, 1987.
5. M. Korupolu, R. Mettu, V. Ramachandran, and Y. Zhao. Experimental evaluation of algorithms for incremental graph connectivity and biconnectivity, 1996.
6. D. Kozen. The design and analysis of algorithms, 1992.
7. 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 action program project No. 3075, 1, 1990.
8. R. E. Tarjan. Efficiency of a good but not linear set union algorithm. Journal of the ACM, 22:215-225, 1975.
9. R. E. Tarjan and J. Van Leeuwen. Worst case analysis of set union algorithms. Journal of the ACM, 31:245-281, 1984.