A class of algorithms which require nonlinear time to maintain disjoint sets
Author:
- Robert Endre TarjanRTRobert Endre Tarjan
- 1 April 1979
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 18 (2) , 110-127
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- On recognizing graph properties from adjacency matricesTheoretical Computer Science, 1976
- Linear expected time of a simple union-find algorithmInformation Processing Letters, 1976
- The intrinsically exponential complexity of the circularity problem for attribute grammarsCommunications of the ACM, 1975
- Efficiency of a Good But Not Linear Set Union AlgorithmJournal of the ACM, 1975
- Set Merging AlgorithmsSIAM Journal on Computing, 1973
- An improved equivalence algorithmCommunications of the ACM, 1964
- On the definition of an algorithm1963