A complement to Tarjan's result about the lower bound on the complexity of the set union problem
- 20 October 1980
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 11 (2) , 59-65
- https://doi.org/10.1016/0020-0190(80)90001-0
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- 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