A note on set union with arbitrary deunions
Open Access
- 28 March 1991
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 37 (6) , 331-335
- https://doi.org/10.1016/0020-0190(91)90151-7
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Worst-case analysis of the set-union problem with extended backtrackingTheoretical Computer Science, 1989
- A Lower Bound on the Complexity of the Union-Split-Find ProblemSIAM Journal on Computing, 1988
- Data Structures for On-Line Updating of Minimum Spanning Trees, with ApplicationsSIAM Journal on Computing, 1985
- Worst-case Analysis of Set Union AlgorithmsJournal of the ACM, 1984
- A data structure for dynamic treesJournal of Computer and System Sciences, 1983
- A class of algorithms which require nonlinear time to maintain disjoint setsJournal of Computer and System Sciences, 1979
- Efficiency of a Good But Not Linear Set Union AlgorithmJournal of the ACM, 1975