Applications of Path Compression on Balanced Trees
- 1 October 1979
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 26 (4) , 690-715
- https://doi.org/10.1145/322154.322161
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Algorithms for updating minimal spanning treesJournal of Computer and System Sciences, 1978
- Finding Minimum Spanning TreesSIAM Journal on Computing, 1976
- Node listings for reducible flow graphsJournal of Computer and System Sciences, 1976
- A Fast and Usually Linear Algorithm for Global Flow AnalysisJournal of the ACM, 1976
- An 0(|E|loglog|V|) algorithm for finding minimum spanning treesInformation Processing Letters, 1975
- Efficiency of a Good But Not Linear Set Union AlgorithmJournal of the ACM, 1975
- Set Merging AlgorithmsSIAM Journal on Computing, 1973
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972
- An improved equivalence algorithmCommunications of the ACM, 1964
- An algorithm for equivalence declarationsCommunications of the ACM, 1961