The DOI matches its Crossref record; 41 of the 41 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.
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
Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
Zahn, C. T. (1971) · IEEE Transactions on Computers · doi:10.1109/t-c.1971.223083 · Cited by 1,759
The Traveling-Salesman Problem and Minimum Spanning Trees
Held, M., & Karp, R. M. (1970) · Operations Research · doi:10.1287/opre.18.6.1138 · Cited by 1,440
Efficiency 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
Fundamentals of Computer Algorithms
Horowitz, E., & Sahni, S. K. (1983) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,375
Blum, M., Floyd, R. W., Pratt, V., Rivest, R. L., & Tarjan, R. E. (1973) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(73)80033-9 · Cited by 1,235
Minimum Spanning Trees and Single Linkage Cluster Analysis
Gower, J. C., & Ross, G. J. S. (1969) · Applied Statistics · doi:10.2307/2346439 · Cited by 1,223
Methods for Computing Wagner Trees
Farris, J. S. (1970) · Systematic Biology · doi:10.1093/sysbio/19.1.83 · Cited by 1,222
SLINK: An optimally efficient algorithm for the single-link cluster method
Sibson, R. (1973) · The Computer Journal · doi:10.1093/comjnl/16.1.30 · Cited by 1,203
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.2307/2033241 · Cited by 1,117
Principles of Numerical Taxonomy
Ross, H. H. (1964) · Systematic Biology · doi:10.2307/sysbio/13.1-4.106 · Cited by 1,050
The traveling-salesman problem and minimum spanning trees: Part II
Held, M., & Karp, R. M. (1971) · Mathematical Programming · doi:10.1007/bf01584070 · Cited by 1,018
The Application of Computers to Taxonomy
Sneath, P. H. A. (1957) · Microbiology · doi:10.1099/00221287-17-1-201 · Cited by 936
Methods for Computing Wagner Trees
Farris, J. S. (1970) · Systematic Zoology · doi:10.2307/2412028 · Cited by 918
Combinatorial Algorithms: Theory and Practice
Reingold, E. M., Nievergelt, J., & Deo, N. (1977) · CERN Document Server (European Organization for Nuclear Research) · Cited by 905
Matroids and the greedy algorithm
Edmonds, J. (1971) · Mathematical Programming · doi:10.1007/bf01584082 · Cited by 866
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
Dreyfus, S. E., & Wagner, R. A. (1971) · Networks · doi:10.1002/net.3230010302 · Cited by 696
Gilbert, E. N., & Pollak, H. O. (1968) · SIAM Journal on Applied Mathematics · doi:10.1137/0116001 · Cited by 690
Jardine, N., & Sibson, R. (1974) · Journal of Marketing Research · doi:10.2307/3151168 · Cited by 636
Finding Minimum Spanning Trees
Cheriton, D. R., & Tarjan, R. E. (1976) · SIAM Journal on Computing · doi:10.1137/0205051 · Cited by 478
Fibonacci 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
Sur la liaison et la division des points d'un ensemble fini
Florek, K., Łukaszewicz, J., Perkal, J., Steinhaus, H., & Zubrzycki, S. (1951) · Colloquium Mathematicum · doi:10.4064/cm-2-3-4-282-285 · Cited by 245
Applied Combinatorial Mathematics
Gilbert, E. N. (1965) · Technometrics · doi:10.1080/00401706.1965.10490279 · Cited by 224
Combinatorial algorithms: Theory and practice
Cooper, L. (1978) · Computers & Mathematics with Applications · doi:10.1016/0898-1221(78)90043-3 · Cited by 220
On Finding and Updating Spanning Trees and Shortest Paths
Spira, P. M., & Pan, A. (1975) · SIAM Journal on Computing · doi:10.1137/0204032 · Cited by 158
Optimal assignments in an ordered set: An application of matroid theory
Gale, D. (1968) · Journal of Combinatorial Theory · doi:10.1016/s0021-9800(68)80039-0 · Cited by 158
Formal Procedures for Connecting Terminals with a Minimum Total Wire Length
Loberman, H., & Weinberger, A. (1957) · Journal of the ACM · doi:10.1145/320893.320896 · Cited by 90
STEINER TREES, STEINER CIRCUITS AND THE INTERFERENCE PROBLEM IN BUILDING DESIGN
Smith, J. M., & Liebman, J. S. (1979) · Engineering Optimization · doi:10.1080/03052157908902401 · Cited by 48
Gilbert, E. N. (1965) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0113021 · Cited by 46
Efficient 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
Finding Minimum Spanning Trees with a Fixed Number of Links at a Node
Glover, F., & Klingman, D. D. (1975) · Springer eBooks · doi:10.1007/978-94-011-7557-9_10 · Cited by 38
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
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.