The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Efficient algorithms for finding minimum spanning trees in undirected and directed 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.
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
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-citationEfficiency of a Good But Not Linear Set Union Algorithm
Tarjan, R. E. (1975) · Journal of the ACM · doi:10.1145/321879.321884 · Cited by 1,403
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
Edmonds, J. (1967) · Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics · doi:10.6028/jres.071b.032 · Cited by 731
Amortized Computational Complexity
Tarjan, R. E. (1985) · SIAM Journal on Algebraic Discrete Methods · doi:10.1137/0606031 · Cited by 520
Self-citationFinding Minimum Spanning Trees
Cheriton, D. R., & Tarjan, R. E. (1976) · SIAM Journal on Computing · doi:10.1137/0205051 · Cited by 428
Self-citationTarjan, R. E. (1977) · Networks · doi:10.1002/net.3230070103 · Cited by 365
Self-citationFibonacci Heaps And Their Uses In Improved Network Optimization Algorithms
Fredman, M. L., & Tarjan, R. E. (2005) · 25th Annual Symposium onFoundations of Computer Science, 1984. · doi:10.1109/sfcs.1984.715934 · Cited by 247
Self-citationA simple derivation of edmonds' algorithm for optimum branchings
Karp, R. M. (1971) · Networks · doi:10.1002/net.3230010305 · Cited by 97
A note on finding optimum branchings
Camerini, P. M., Fratta, L., & Maffioli, F. (1979) · Networks · doi:10.1002/net.3230090403 · Cited by 94
Efficient algorithms for a family of matroid intersection problems
Gabow, H. N., & Tarjan, R. E. (1984) · Journal of Algorithms · doi:10.1016/0196-6774(84)90042-7 · Cited by 88
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
Self-citation
Cited by
An optimal minimum spanning tree algorithm
Pettie, S., & Ramachandran, V. (2002) · Journal of the ACM · doi:10.1145/505241.505243 · Cited by 296
Metadata
- Authors
- Gabow, H. N., Galil, Z., Spencer, T., & Tarjan, R. E.
- Venue
- Combinatorica
- Published
- 1986-06
- Volume
- 6
- Issue
- 2
- Pages
- 109-122
- ISSN
- 0209-9683 (ISSN-L)
- 1439-6912
- OpenAlex
- W1982512167
- Cited by
- 517
- References
- 12
- FWCI
- 7.63
- Type
- journal article
- Language
- en
- Open access
- closed
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
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.
