The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
A randomized linear-time algorithm to find minimum spanning trees
Open accessAbstract
We present a randomized linear-time algorithm to find a minimum spanning tree in a connected graph with edge weights. The algorithm uses random sampling in combination with a recently discovered linear-time algorithm for verifying a minimum spanning tree. Our computational model is a unit-cost random-access machine with the restriction that the only operations allowed on edge weights are binary comparisons.
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.
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
Cites
An introduction to probability theory and its applications
(1958) · Journal of the Franklin Institute · doi:10.1016/0016-0032(58)90688-4 · Cited by 29,269
On the shortest spanning subtree of a graph and the traveling salesman problem
Kruskal, J. B. (1956) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-1956-0078686-7 · Cited by 5,088
Spencer, J. (1991) · Medical Entomology and Zoology · Cited by 4,310
A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
Chernoff, H. (1952) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729330 · Cited by 3,550
Data Structures and Network Algorithms
Tarjan, R. E. (1983) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970265 · Cited by 2,057
Self-citationOn the History of the Minimum Spanning Tree Problem
Graham, R. L., & Hell, P. (1985) · IEEE Annals of the History of Computing · doi:10.1109/mahc.1985.10011 · Cited by 813
Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
Gabow, H. N., Galil, Z., Spencer, T., & Tarjan, R. E. (1986) · Combinatorica · doi:10.1007/bf02579168 · Cited by 517
Self-citationTrans-dichotomous algorithms for minimum spanning trees and shortest paths
Fredman, M. L., & Willard, D. E. (1994) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(05)80064-9 · Cited by 419
Global min-cuts in RNC, and other ramifications of a simple min-cut algorithm
Karger, D. R. (1993) · doi:10.5555/313559.313605 · Cited by 238
Self-citationEfficient Implementation Of Graph Algorithms Using Contraction
Gabow, H. N., Galil, Z., & Spencer, T. H. (1984) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1984.715935 · Cited by 39
Cited by
Accelerated Hierarchical Density Based Clustering
McInnes, L., & Healy, J. (2017) · 2017 IEEE International Conference on Data Mining Workshops (ICDMW) · doi:10.1109/icdmw.2017.12 · Cited by 434
An optimal minimum spanning tree algorithm
Pettie, S., & Ramachandran, V. (2002) · Journal of the ACM · doi:10.1145/505241.505243 · Cited by 296
A novel approach for quantitative assessment of mucosal damage in inflammatory bowel disease
Matalka, I. I., Al-Omari, F. A., Salama, R. M., & Mohtaseb, A. H. (2013) · Diagnostic Pathology · doi:10.1186/1746-1596-8-156 · Cited by 25
Metadata
- Authors
- Karger, D. R., Klein, P. N., & Tarjan, R. E.
- Venue
- Journal of the ACM
- Published
- 1995-03
- Volume
- 42
- Issue
- 2
- Pages
- 321-328
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2138304862
- Cited by
- 406
- References
- 10
- FWCI
- 17.85
- Type
- journal article
- Language
- en
- Open access
- bronze
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 randomized linear-time algorithm to find minimum spanning trees. https://app.cochat.ai/papers/10.1145/201019.201022
- The paper
- Karger, D. R., Klein, P. N., & Tarjan, R. E. (1995). A randomized linear-time algorithm to find minimum spanning trees. Journal of the ACM. https://doi.org/10.1145/201019.201022
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.
