On the History of the Minimum Spanning Tree Problem
The DOI matches its Crossref record; 41 of the 41 references it cites were found in a registry or an index.
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.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
A note on two problems in connexion with graphs
Dijkstra, E. W. (1959) · Numerische Mathematik · doi:10.1007/bf01386390 · Cited by 29,065
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
Sørensen, T. B., Sorensen, T., Biering-Sørensen, T., Ti, S., & Sorensen, J. (1948) · Medical Entomology and Zoology · Cited by 5,979
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
Hierarchical Clustering Schemes
Johnson, S. C. (1967) · Psychometrika · doi:10.1007/bf02289588 · Cited by 4,897
Shortest Connection Networks And Some Generalizations
Prim, R. C. (1957) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1957.tb01515.x · Cited by 4,565
Pattern Classification and Scene Analysis
Thompson, M., Duda, R. O., & Hart, P. E. (1974) · Leonardo · doi:10.2307/1573081 · Cited by 4,495
Combinatorial optimization: networks and matroids
Lawler, E. L. (2021) · Cited by 3,310
Principles of Numerical Taxonomy
(2013) · Personality Structure and Measurement (Psychology Revivals) · doi:10.4324/9780203766804-11 · Cited by 2,990
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
Cited by
Fibonacci heaps and their uses in improved network optimization algorithms
Fredman, M. L., & Tarjan, R. E. (1987) · Journal of the ACM · doi:10.1145/28869.28874 · Cited by 3,132
Algorithms for hierarchical clustering: an overview
Murtagh, F., & Contreras, P. (2012) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.53 · Cited by 1,874
Handbook of Combinatorial Optimization
(1999) · Springer eBooks · doi:10.1007/978-1-4757-3023-4 · Cited by 1,216
Chong, E., Han, C., & Park, F. C. (2017) · Expert Systems with Applications · doi:10.1016/j.eswa.2017.04.030 · Cited by 834
A Gaia DR2 view of the open cluster population in the Milky Way
Cantat-Gaudin, T., Jordi, C., Vallenari, A., Bragaglia, A., Balaguer-Núñez, L., Soubiran, C., Bossini, D., Moitinho, A., Castro-Ginard, A., Krone-Martins, A., et al. (2018) · Astronomy & Astrophysics · doi:10.1051/0004-6361/201833476 · Cited by 700
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
Business process analysis in healthcare environments: A methodology based on process mining
Rebuge, Á., & Ferreira, D. R. (2012) · Information Systems · doi:10.1016/j.is.2011.01.003 · Cited by 494
A randomized linear-time algorithm to find minimum spanning trees
Karger, D. R., Klein, P. N., & Tarjan, R. E. (1995) · Journal of the ACM · doi:10.1145/201019.201022 · Cited by 406
Percolation on complex networks: Theory and application
Li, M., Liu, R.-R., Lü, L., Hu, M.-B., Xu, S., & Zhang, Y.-C. (2021) · Physics Reports · doi:10.1016/j.physrep.2020.12.003 · Cited by 365
Watershed Cuts: Minimum Spanning Forests and the Drop of Water Principle
Cousty, J., Bertrand, G., Najman, L., & Couprie, M. (2009) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2008.173 · Cited by 352
The minimum spanning tree: An unbiased method for brain network analysis
Tewarie, P., van Dellen, E., Hillebrand, A., & Stam, C. J. (2015) · NeuroImage · doi:10.1016/j.neuroimage.2014.10.015 · Cited by 345
A minimum spanning tree algorithm with inverse-Ackermann type complexity
Chazelle, B. (2000) · Journal of the ACM · doi:10.1145/355541.355562 · Cited by 328
An optimal minimum spanning tree algorithm
Pettie, S., & Ramachandran, V. (2002) · Journal of the ACM · doi:10.1145/505241.505243 · Cited by 296
Algorithms for hierarchical clustering: an overview,II
Murtagh, F., & Contreras, P. (2017) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.1219 · Cited by 285
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
- 41
- 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
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.