Data structures and algorithms for disjoint set union problems
- 1 September 1991
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 23 (3) , 319-344
- https://doi.org/10.1145/116873.116878
Abstract
No abstract availableThis publication has 49 references indexed in Scilit:
- The set union problem with dynamic weighted backtrackingBIT Numerical Mathematics, 1991
- A note on set union with arbitrary deunionsInformation Processing Letters, 1991
- Worst-case analysis of the set-union problem with extended backtrackingTheoretical Computer Science, 1989
- The longest common subsequence problem revisitedAlgorithmica, 1987
- Dynamic orthogonal segment intersection searchJournal of Algorithms, 1987
- Login: a logic programming language with built-in inheritanceThe Journal of Logic Programming, 1986
- A linear-time algorithm for a special case of disjoint set unionJournal of Computer and System Sciences, 1985
- A fast algorithm for computing longest common subsequencesCommunications of the ACM, 1977
- Design and implementation of an efficient priority queueTheory of Computing Systems, 1976
- Linear expected time of a simple union-find algorithmInformation Processing Letters, 1976