A Lower Bound on the Complexity of the Union-Split-Find Problem
- 1 December 1988
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 17 (6) , 1093-1102
- https://doi.org/10.1137/0217070
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- On the Single-Operation Worst-Case Time Complexity of the Disjoint Set Union ProblemSIAM Journal on Computing, 1986
- Data Structures and Algorithms 3Published by Springer Nature ,1984
- Data Structures and Algorithms 1Published by Springer Nature ,1984
- Storage Modification MachinesSIAM Journal on Computing, 1980
- A class of algorithms which require nonlinear time to maintain disjoint setsJournal of Computer and System Sciences, 1979
- Design and implementation of an efficient priority queueTheory of Computing Systems, 1976
- Set Merging AlgorithmsSIAM Journal on Computing, 1973