The DOI matches its OpenAlex record.
On the Shortest Spanning Subtree of a Graph and the Traveling Salesman 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
Cited by
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
Approximating discrete probability distributions with dependence trees
Chow, C., & Liu, C. (1968) · IEEE Transactions on Information Theory · doi:10.1109/tit.1968.1054142 · Cited by 1,720
GrapeTree: visualization of core genomic relationships among 100,000 bacterial pathogens
Zhou, Z., Alikhan, N.-F., Sergeant, M. J., Luhmann, N., Vaz, C., Francisco, A. P., Carriço, J. A., & Achtman, M. (2018) · Genome Research · doi:10.1101/gr.232397.117 · Cited by 1,060
Shamos, M. I., & Hoey, D. (1975) · 16th Annual Symposium on Foundations of Computer Science (sfcs 1975) · doi:10.1109/sfcs.1975.8 · Cited by 1,057
On 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
An analysis of several heuristics for the traveling salesman problem
Rosenkrantz, D. J., Stearns, R. E., & Lewis, P. M. (2009) · Fundamental Problems in Computing · doi:10.1007/978-1-4020-9688-4_3 · Cited by 772
Smart home energy management system using IEEE 802.15.4 and zigbee
Han, D.-M., & Lim, J.-H. (2010) · IEEE Transactions on Consumer Electronics · doi:10.1109/tce.2010.5606276 · Cited by 663
Design and implementation of smart home energy management systems based on zigbee
Han, D.-M., & Lim, J.-H. (2010) · IEEE Transactions on Consumer Electronics · doi:10.1109/tce.2010.5606278 · Cited by 568
The TimberWolf placement and routing package
Sechen, C., & Sangiovanni-Vincentelli, A. (1985) · IEEE Journal of Solid-State Circuits · doi:10.1109/jssc.1985.1052337 · Cited by 532
Alexander-Bloch, A. F., Gogtay, N., Meunier, D., Birn, R., Clasen, L., Lalonde, F., Lenroot, R., Giedd, J., & Bullmore, E. T. (2010) · Frontiers in Systems Neuroscience · doi:10.3389/fnsys.2010.00147 · Cited by 480
Gai, Y., Krishnamachari, B., & Jain, R. (2012) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2011.2181864 · Cited by 413
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
A Review of Methodological Approaches for the Design and Optimization of Wind Farms
Herbert-Acero, J., Probst, O., Réthoré, P.-E., Larsen, G., & Castillo-Villar, K. (2014) · Energies · doi:10.3390/en7116930 · Cited by 311
Power Watershed: A Unifying Graph-Based Optimization Framework
Couprie, C., Grady, L., Najman, L., & Talbot, H. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.200 · Cited by 305
Xu, Y., Olman, V., & Xu, D. (2002) · Bioinformatics · doi:10.1093/bioinformatics/18.4.536 · Cited by 295
Real-Time Salient Object Detection with a Minimum Spanning Tree
Tu, W.-C., He, S., Yang, Q., & Chien, S.-Y. (2016) · 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2016.256 · Cited by 290
Robust and accurate skeletal rigging from mesh sequences
Le, B. H., & Deng, Z. (2014) · ACM Transactions on Graphics · doi:10.1145/2601097.2601161 · Cited by 111
Global Pose Estimation with an Attention-Based Recurrent Network
Parisotto, E., Chaplot, D. S., Zhang, J., & Salakhutdinov, R. (2018) · 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW) · doi:10.1109/cvprw.2018.00061 · Cited by 88
Minimum-Spanning-Tree-Based Time Delay Estimation Robust to Outliers
Yamaoka, K., Nakashima, T., Wakabayashi, Y., & Ono, N. (2023) · IEEE Access · doi:10.1109/access.2023.3327011 · Cited by 3
Metadata
- Authors
- Kruskal, J. B.
- Venue
- Proceedings of the American Mathematical Society
- Publisher
- American Mathematical Society
- Published
- 1956-02-01
- Volume
- 7
- Issue
- 1
- Pages
- 48-48
- ISSN
- 0002-9939 (ISSN-L)
- OpenAlex
- W4255306344
- Cited by
- 1,117
- References
- 0
- FWCI
- 1.00
- 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.