The DOI matches its Crossref record.
A linear-time algorithm for a special case of disjoint set union
Abstract
This paper presents a linear-time algorithm for the special case of the disjoint set union problem in which the structure of the unions (defined by a “union tree”) is known in advance. The algorithm executes an intermixed sequence of m union and find operations on n elements in 0(m+n) time and 0(n) space. This is a slight but theoretically significant improvement over the fastest known algorithm for the general problem, which runs in 0(ma(m+n, n)+n) time and 0(n) space, where a is a functional inverse of Ackermann's function. Used as a subroutine, the algorithm gives similar improvements in the efficiency of algorithms for solving a number of other problems, including two-processor scheduling, the off-line min problem, matching on convex graphs, finding nearest common ancestors off-line, testing a flow graph for reducibility, and finding two disjoint directed spanning trees. The algorithm obtains its efficiency by combining a fast algorithm for the general problem with table look-up on small sets, and requires a random access machine for its implementation. The algorithm extends to the case in which single-node additions to the union tree are allowed. The extended algorithm is useful in finding maximum cardinality matchings on nonbipartite graphs.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“By the results of Gabow and Tarjan (1983), the time needed to construct the union-find data structure and perform these operations on it is also O ( n ) .”
From Longest Gapped Repeats and Palindromes (2017) · cites this paper as Gabow and Tarjan (1983)
In the citing paper
“As a first consequence of the algorithms of Gabow and Tarjan (1983), we recall a folklore result, stating that we can process in O ( n ) time a weighted tree with O ( n ) nodes and all weights in O ( n ) so that we can compute off-line, also in linear time, the answer to O ( n ) weighted level ancestor queries on the nodes of this tree”
From Longest Gapped Repeats and Palindromes (2017) · cites this paper as Gabow and Tarjan (1983)
In the citing paper
“Under this assumption, a data-structure fulfilling the above requirements can be constructed in O ( d ) time such that performing a sequence of m fi nd and union operations takes O ( m ) time in the computation model we use (see Gabow and Tarjan (1983)).”
From Longest Gapped Repeats and Palindromes (2017) · cites this paper as Gabow and Tarjan (1983)
In the citing paper
“Moreover, our structure fulfils the conditions that the efficient union-find data structure of Gabow and Tarjan (1983) should fulfil: the unions we make form a tree.”
From Longest Gapped Repeats and Palindromes (2017) · cites this paper as Gabow and Tarjan (1983)
In the citing paper
“By the results of Gabow and Tarjan (1983), as we know the structure of the unions we can make forms a tree, our algorithm runs in O ( n + k ) time.”
From Longest Gapped Repeats and Palindromes (2017) · cites this paper as Gabow and Tarjan (1983)
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Handbook of Constraint Programming
(2006) · Foundations of Artificial Intelligence · doi:10.1016/s1574-6526(06)x8001-x · Cited by 1,483
The NP-completeness column: An ongoing guide
Johnson, D. S. (1986) · Journal of Algorithms · doi:10.1016/0196-6774(86)90020-9 · Cited by 794
A survey of community search over big graphs
Fang, Y., Huang, X., Qin, L., Zhang, Y., Zhang, W., Cheng, R., & Lin, X. (2020) · The VLDB Journal · doi:10.1007/s00778-019-00556-x · Cited by 339
Longest Gapped Repeats and Palindromes
Dumitran, M., Gawrychowski, P., & Manea, F. (2017) · Discrete Mathematics & Theoretical Computer Science · doi:10.23638/dmtcs-19-4-4 · Cited by 11
Metadata
- Authors
- Gabow, H. N., & Tarjan, R. E.
- Venue
- Proceedings of the fifteenth annual ACM symposium on Theory of computing - STOC '83
- Publisher
- ACM Press
- Published
- 1983
- Pages
- 246-251
- Cited by
- 94
- References
- 0
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A linear-time algorithm for a special case of disjoint set union. https://app.cochat.ai/papers/10.1145/800061.808753
- The paper
- Gabow, H. N., & Tarjan, R. E. (1983). A linear-time algorithm for a special case of disjoint set union. Proceedings of the fifteenth annual ACM symposium on Theory of computing - STOC '83. https://doi.org/10.1145/800061.808753
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.