A linear-time algorithm for a special case of disjoint set union
- 1 April 1985
- journal article
- Published by Elsevier BV in Journal of Computer and System Sciences
- Vol. 30 (2), 209-221
- https://doi.org/10.1016/0022-0000(85)90014-5
Abstract
No abstract availableKeywords
This publication has 27 references indexed in Scilit:
- An O(n log n) Manhattan path algorithmInformation Processing Letters, 1984
- Worst-case Analysis of Set Union AlgorithmsJournal of the ACM, 1984
- Scheduling unit-time tasks with integer release times and deadlinesInformation Processing Letters, 1983
- An Almost-Linear Algorithm for Two-Processor SchedulingJournal of the ACM, 1982
- Le group des algebras quadratiques(∗).Communications in Algebra, 1982
- Applications of Path Compression on Balanced TreesJournal of the ACM, 1979
- A fast algorithm for finding dominators in a flowgraphACM Transactions on Programming Languages and Systems, 1979
- Linear expected time of a simple union-find algorithmInformation Processing Letters, 1976
- An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on GraphsJournal of the ACM, 1976
- Efficiency of a Good But Not Linear Set Union AlgorithmJournal of the ACM, 1975