The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
On the History of the Minimum Spanning Tree Problem
Abstract
It is standard practice among authors discussing the minimum spanning tree problem to refer to the work of Kruskal(1956) and Prim (1957) as the sources of the problem and its first efficient solutions, despite the citation by both of Boruvka (1926) as a predecessor. In fact, there are several apparently independent sources and algorithmic solutions of the problem. They have appeared in Czechoslovakia, France, and Poland, going back to the beginning of this century. We shall explore and compare these works and their motivations, and relate them to the most recent advances on the minimum spanning tree problem.
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
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
Cited by
Chong, E., Han, C., & Park, F. C. (2017) · Expert Systems with Applications · doi:10.1016/j.eswa.2017.04.030 · Cited by 834
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
ShuTu: Open-Source Software for Efficient and Accurate Reconstruction of Dendritic Morphology
Jin, D. Z., Zhao, T., Hunt, D. L., Tillage, R. P., Hsu, C.-L., & Spruston, N. (2019) · Frontiers in Neuroinformatics · doi:10.3389/fninf.2019.00068 · Cited by 13
Metadata
- Authors
- Graham, R. L., & Hell, P.
- Venue
- IEEE Annals of the History of Computing
- Published
- 1985
- Volume
- 7
- Issue
- 1
- Pages
- 43-57
- ISSN
- 0164-1239 (ISSN-L)
- 1058-6180
- OpenAlex
- W2087216833
- Cited by
- 813
- References
- 1
- FWCI
- 3.89
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On the History of the Minimum Spanning Tree Problem. https://app.cochat.ai/papers/10.1109/mahc.1985.10011
- The paper
- Graham, R. L., & Hell, P. (1985). On the History of the Minimum Spanning Tree Problem. IEEE Annals of the History of Computing. https://doi.org/10.1109/mahc.1985.10011
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.
