Postorder Disjoint Set Union is Linear
- 1 October 1990
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 19 (5) , 868-882
- https://doi.org/10.1137/0219060
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- The pairing heap: A new form of self-adjusting heapAlgorithmica, 1986
- Nonlinearity of davenport—Schinzel sequences and of generalized path compression schemesCombinatorica, 1986
- Sequential access in splay trees takes linear timeCombinatorica, 1985
- Self-adjusting binary search treesJournal of the ACM, 1985
- Worst-case Analysis of Set Union AlgorithmsJournal of the ACM, 1984
- Efficiency of a Good But Not Linear Set Union AlgorithmJournal of the ACM, 1975
- Efficiency of Equivalence AlgorithmsPublished by Springer Nature ,1972