Minimum spanning tree (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Minimum spanning tree" in English language version.

Last modified: 06:19:07, 26 August 2026 (UTC)

Ref.Un. Ref.Website

Global rank English rank

4539doi.org

2^nd place

2216ams.org

434^th place

249^th place

1813semanticscholar.org

15^th place

8^th place

73umich.edu

429^th place

307^th place

55nih.gov

5^th place

55adsabs.harvard.edu

14^th place

9^th place

33worldcat.org

4^th place

33web.archive.org

1^st place

22jstor.org

23^rd place

15^th place

22arxiv.org

49^th place

31^st place

22ghostarchive.org

64^th place

28^th place

22acm.org

1,200^th place

821^st place

21books.google.com

3^rd place

22dtic.mil

934^th place

530^th place

11scipy.org

low place

11networkx.org

low place

11stackexchange.com

4,114^th place

3,027^th place

11siam.org

9,070^th place

5,832^nd place

11purdue.edu

1,391^st place

979^th place

11upenn.edu

784^th place

498^th place

11creativecommons.org

580^th place

287^th place

11forth.gr

low place

11blogspot.ru

7,461^st place

low place

11ucalgary.ca

3,492^nd place

2,416^th place

11att.com

low place

7,681^st place

11fu-berlin.de

3,170^th place

4,291^st place

11zenodo.org

737^th place

426^th place

11researchgate.net

96^th place

89^th place

acm.org (Global: 1,200^th place; English: 821^st place)

portal.acm.org

Pettie, Seth; Ramachandran, Vijaya (2002), "Minimizing randomness in minimum spanning tree, parallel connectivity, and set maxima algorithms", Proc. 13th ACM-SIAM Symposium on Discrete Algorithms (SODA '02), San Francisco, California, pp. 713–722, ISBN 978-0-89871-513-2{{citation}}: CS1 maint: location missing publisher (link).

dl.acm.org

Supowit, Kenneth J.; Plaisted, David A.; Reingold, Edward M. (1980). Heuristics for weighted perfect matching. 12th Annual ACM Symposium on Theory of Computing (STOC '80). New York, NY, USA: ACM. pp. 398–419. doi:10.1145/800141.804689.

adsabs.harvard.edu (Global: 14^th place; English: 9^th place)

ui.adsabs.harvard.edu

Graham, R. L.; Hell, Pavol (1985), "On the history of the minimum spanning tree problem", Annals of the History of Computing, 7 (1): 43–57, Bibcode:1985IAHC....7a..43G, doi:10.1109/MAHC.1985.10011, MR 0783327, S2CID 10555375
Päivinen, Niina (1 May 2005). "Clustering with a minimum spanning tree of scale-free-like structure". Pattern Recognition Letters. 26 (7): 921–930. Bibcode:2005PaReL..26..921P. doi:10.1016/j.patrec.2004.09.039.
Assunção, R. M.; M. C. Neves; G. Câmara; C. Da Costa Freitas (2006). "Efficient regionalization techniques for socio-economic geographical units using minimum spanning trees". International Journal of Geographical Information Science. 20 (7): 797–811. Bibcode:2006IJGIS..20..797A. doi:10.1080/13658810600665111. S2CID 2530748.
Devillers, J.; Dore, J.C. (1 April 1989). "Heuristic potency of the minimum spanning tree (MST) method in toxicology". Ecotoxicology and Environmental Safety. 17 (2): 227–235. Bibcode:1989EcoES..17..227D. doi:10.1016/0147-6513(89)90042-0. PMID 2737116.
Mori, H.; Tsuzuki, S. (1 May 1991). "A fast method for topological observability analysis using a minimum spanning tree technique". IEEE Transactions on Power Systems. 6 (2): 491–500. Bibcode:1991ITPSy...6..491M. doi:10.1109/59.76691.

ams.org (Global: 434^th place; English: 249^th place)

mathscinet.ams.org

Pettie, Seth; Ramachandran, Vijaya (2002), "An optimal minimum spanning tree algorithm" (PDF), Journal of the Association for Computing Machinery, 49 (1): 16–34, doi:10.1145/505241.505243, MR 2148431, S2CID 5362916.
Karger, David R.; Klein, Philip N.; Tarjan, Robert E. (1995), "A randomized linear-time algorithm to find minimum spanning trees", Journal of the Association for Computing Machinery, 42 (2): 321–328, doi:10.1145/201019.201022, MR 1409738, S2CID 832583
Chazelle, Bernard (2000), "A minimum spanning tree algorithm with inverse-Ackermann type complexity", Journal of the Association for Computing Machinery, 47 (6): 1028–1047, doi:10.1145/355541.355562, MR 1866456, S2CID 6276962.
Chazelle, Bernard (2000), "The soft heap: an approximate priority queue with optimal error rate", Journal of the Association for Computing Machinery, 47 (6): 1012–1027, doi:10.1145/355541.355554, MR 1866455, S2CID 12556140.
Fredman, M. L.; Willard, D. E. (1994), "Trans-dichotomous algorithms for minimum spanning trees and shortest paths", Journal of Computer and System Sciences, 48 (3): 533–551, doi:10.1016/S0022-0000(05)80064-9, MR 1279413.
Chong, Ka Wong; Han, Yijie; Lam, Tak Wah (2001), "Concurrent threads and optimal parallel minimum spanning trees algorithm", Journal of the Association for Computing Machinery, 48 (2): 297–323, doi:10.1145/375827.375847, MR 1868718, S2CID 1778676.
Pettie, Seth; Ramachandran, Vijaya (2002), "A randomized time-work optimal parallel algorithm for finding a minimum spanning forest" (PDF), SIAM Journal on Computing, 31 (6): 1879–1895, doi:10.1137/S0097539700371065, MR 1954882.
Steele, J. Michael (2002), "Minimal spanning trees for graphs with random edge lengths", Mathematics and computer science, II (Versailles, 2002), Trends Math., Basel: Birkhäuser, pp. 223–245, MR 1940139
Grötschel, Martin; Lovász, László; Schrijver, Alexander (1993), Geometric algorithms and combinatorial optimization, Algorithms and Combinatorics, vol. 2 (2nd ed.), Springer-Verlag, Berlin, doi:10.1007/978-3-642-78240-4, ISBN 978-3-642-78242-8, MR 1261419
Garey, Michael R.; Johnson, David S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. Series of Books in the Mathematical Sciences (1st ed.). New York: W. H. Freeman and Company. ISBN 978-0-7167-1045-5. MR 0519066. OCLC 247570676.. ND12
Gabow, Harold N. (1977), "Two algorithms for generating weighted spanning trees in order", SIAM Journal on Computing, 6 (1): 139–150, doi:10.1137/0206011, MR 0441784.
Eppstein, David (1992), "Finding the k smallest spanning trees", BIT, 32 (2): 237–248, doi:10.1007/BF01994879, MR 1172188, S2CID 121160520.
Frederickson, Greg N. (1997), "Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees", SIAM Journal on Computing, 26 (2): 484–538, doi:10.1137/S0097539792226825, MR 1438526.
Spira, P. M.; Pan, A. (1975), "On finding and updating spanning trees and shortest paths" (PDF), SIAM Journal on Computing, 4 (3): 375–380, doi:10.1137/0204032, MR 0378466.
Holm, Jacob; de Lichtenberg, Kristian; Thorup, Mikkel (2001), "Poly-logarithmic deterministic fully dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity", Journal of the Association for Computing Machinery, 48 (4): 723–760, doi:10.1145/502090.502095, MR 2144928, S2CID 7273552.
Graham, R. L.; Hell, Pavol (1985), "On the history of the minimum spanning tree problem", Annals of the History of Computing, 7 (1): 43–57, Bibcode:1985IAHC....7a..43G, doi:10.1109/MAHC.1985.10011, MR 0783327, S2CID 10555375

arxiv.org (Global: 49^th place; English: 31^st place)

Simas, Tiago; Correia, Rion B.; Rocha, Luis M. (2021), "The distance backbone of complex networks", Journal of Complex Networks, 9 (6) cnab021, arXiv:2103.04668, doi:10.1093/comnet/cnab021, PMID 38348382.
Mantegna, R. N. (1999). Hierarchical structure in financial markets. The European Physical Journal B-Condensed Matter and Complex Systems, 11(1), 193–197.

att.com (Global: low place; English: 7,681^st place)

akpublic.research.att.com

Dahlhaus, E.; Johnson, D. S.; Papadimitriou, C. H.; Seymour, P. D.; Yannakakis, M. (August 1994). "The complexity of multiterminal cuts" (PDF). SIAM Journal on Computing. 23 (4): 864–894. doi:10.1137/S0097539792225297. Archived from the original (PDF) on 24 August 2004. Retrieved 17 December 2012.

blogspot.ru (Global: 7,461^st place; English: low place)

flashing-thoughts.blogspot.ru

"Everything about Bottleneck Spanning Tree". flashing-thoughts.blogspot.ru. 5 June 2010. Retrieved 4 April 2018.

books.google.com (Global: 3^rd place; English: 3^rd place)

Grötschel, Martin; Lovász, László; Schrijver, Alexander (1993), Geometric algorithms and combinatorial optimization, Algorithms and Combinatorics, vol. 2 (2nd ed.), Springer-Verlag, Berlin, doi:10.1007/978-3-642-78240-4, ISBN 978-3-642-78242-8, MR 1261419

creativecommons.org (Global: 580^th place; English: 287^th place)

Rozum, Jordan C.; Rocha, Luis M. (2021), "The ultrametric backbone is the union of all minimum spanning forests", Journal of Physics: Complexity, 5 (3): 035009, doi:10.1088/2632-072X/ad679e, PMID 39131403. This article incorporates text from this source, which is available under the CC BY 4.0 license.

doi.org (Global: 2^nd place; English: 2^nd place)

Pettie, Seth; Ramachandran, Vijaya (2002), "An optimal minimum spanning tree algorithm" (PDF), Journal of the Association for Computing Machinery, 49 (1): 16–34, doi:10.1145/505241.505243, MR 2148431, S2CID 5362916.
Karger, David R.; Klein, Philip N.; Tarjan, Robert E. (1995), "A randomized linear-time algorithm to find minimum spanning trees", Journal of the Association for Computing Machinery, 42 (2): 321–328, doi:10.1145/201019.201022, MR 1409738, S2CID 832583
Chazelle, Bernard (2000), "A minimum spanning tree algorithm with inverse-Ackermann type complexity", Journal of the Association for Computing Machinery, 47 (6): 1028–1047, doi:10.1145/355541.355562, MR 1866456, S2CID 6276962.
Chazelle, Bernard (2000), "The soft heap: an approximate priority queue with optimal error rate", Journal of the Association for Computing Machinery, 47 (6): 1012–1027, doi:10.1145/355541.355554, MR 1866455, S2CID 12556140.
Fredman, M. L.; Tarjan, R. E. (1987). "Fibonacci heaps and their uses in improved network optimization algorithms". Journal of the ACM. 34 (3): 596. doi:10.1145/28869.28874. S2CID 7904683.
Gabow, H. N.; Galil, Z.; Spencer, T.; Tarjan, R. E. (1986). "Efficient algorithms for finding minimum spanning trees in undirected and directed graphs". Combinatorica. 6 (2): 109. doi:10.1007/bf02579168. S2CID 35618095.
Fredman, M. L.; Willard, D. E. (1994), "Trans-dichotomous algorithms for minimum spanning trees and shortest paths", Journal of Computer and System Sciences, 48 (3): 533–551, doi:10.1016/S0022-0000(05)80064-9, MR 1279413.
Matsui, Tomomi (1995-03-10). "The minimum spanning tree problem on a planar graph". Discrete Applied Mathematics. 58 (1): 91–94. doi:10.1016/0166-218X(94)00095-U. ISSN 0166-218X.
Cheriton, David; Tarjan, Robert Endre (December 1976). "Finding Minimum Spanning Trees". SIAM Journal on Computing. 5 (4): 724–742. doi:10.1137/0205051. ISSN 0097-5397.
Chong, Ka Wong; Han, Yijie; Lam, Tak Wah (2001), "Concurrent threads and optimal parallel minimum spanning trees algorithm", Journal of the Association for Computing Machinery, 48 (2): 297–323, doi:10.1145/375827.375847, MR 1868718, S2CID 1778676.
Pettie, Seth; Ramachandran, Vijaya (2002), "A randomized time-work optimal parallel algorithm for finding a minimum spanning forest" (PDF), SIAM Journal on Computing, 31 (6): 1879–1895, doi:10.1137/S0097539700371065, MR 1954882.
Grötschel, Martin; Lovász, László; Schrijver, Alexander (1993), Geometric algorithms and combinatorial optimization, Algorithms and Combinatorics, vol. 2 (2nd ed.), Springer-Verlag, Berlin, doi:10.1007/978-3-642-78240-4, ISBN 978-3-642-78242-8, MR 1261419
Gabow, Harold N. (1977), "Two algorithms for generating weighted spanning trees in order", SIAM Journal on Computing, 6 (1): 139–150, doi:10.1137/0206011, MR 0441784.
Eppstein, David (1992), "Finding the k smallest spanning trees", BIT, 32 (2): 237–248, doi:10.1007/BF01994879, MR 1172188, S2CID 121160520.
Frederickson, Greg N. (1997), "Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees", SIAM Journal on Computing, 26 (2): 484–538, doi:10.1137/S0097539792226825, MR 1438526.
Jothi, Raja; Raghavachari, Balaji (2005), "Approximation Algorithms for the Capacitated Minimum Spanning Tree Problem and Its Variants in Network Design", ACM Trans. Algorithms, 1 (2): 265–282, doi:10.1145/1103963.1103967, S2CID 8302085
Hu, T. C. (1961), "The maximum capacity route problem", Operations Research, 9 (6): 898–900, doi:10.1287/opre.9.6.898, JSTOR 167055.
Simas, Tiago; Correia, Rion B.; Rocha, Luis M. (2021), "The distance backbone of complex networks", Journal of Complex Networks, 9 (6) cnab021, arXiv:2103.04668, doi:10.1093/comnet/cnab021, PMID 38348382.
Rozum, Jordan C.; Rocha, Luis M. (2021), "The ultrametric backbone is the union of all minimum spanning forests", Journal of Physics: Complexity, 5 (3): 035009, doi:10.1088/2632-072X/ad679e, PMID 39131403. This article incorporates text from this source, which is available under the CC BY 4.0 license.
Spira, P. M.; Pan, A. (1975), "On finding and updating spanning trees and shortest paths" (PDF), SIAM Journal on Computing, 4 (3): 375–380, doi:10.1137/0204032, MR 0378466.
Holm, Jacob; de Lichtenberg, Kristian; Thorup, Mikkel (2001), "Poly-logarithmic deterministic fully dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity", Journal of the Association for Computing Machinery, 48 (4): 723–760, doi:10.1145/502090.502095, MR 2144928, S2CID 7273552.
Chin, F.; Houck, D. (1978), "Algorithms for updating minimal spanning trees", Journal of Computer and System Sciences, 16 (3): 333–344, doi:10.1016/0022-0000(78)90022-3.
Chang, R.S.; Leu, S.J. (1997), "The minimum labeling spanning trees", Information Processing Letters, 63 (5): 277–282, doi:10.1016/s0020-0190(97)00127-0.
Graham, R. L.; Hell, Pavol (1985), "On the history of the minimum spanning tree problem", Annals of the History of Computing, 7 (1): 43–57, Bibcode:1985IAHC....7a..43G, doi:10.1109/MAHC.1985.10011, MR 0783327, S2CID 10555375
Dahlhaus, E.; Johnson, D. S.; Papadimitriou, C. H.; Seymour, P. D.; Yannakakis, M. (August 1994). "The complexity of multiterminal cuts" (PDF). SIAM Journal on Computing. 23 (4): 864–894. doi:10.1137/S0097539792225297. Archived from the original (PDF) on 24 August 2004. Retrieved 17 December 2012.
Supowit, Kenneth J.; Plaisted, David A.; Reingold, Edward M. (1980). Heuristics for weighted perfect matching. 12th Annual ACM Symposium on Theory of Computing (STOC '80). New York, NY, USA: ACM. pp. 398–419. doi:10.1145/800141.804689.
Sneath, P. H. A. (1 August 1957). "The Application of Computers to Taxonomy". Journal of General Microbiology. 17 (1): 201–226. doi:10.1099/00221287-17-1-201. PMID 13475686.
Asano, T.; Bhattacharya, B.; Keil, M.; Yao, F. (1988). Clustering algorithms based on minimum and maximum spanning trees. Fourth Annual Symposium on Computational Geometry (SCG '88). Vol. 1. pp. 252–257. doi:10.1145/73393.73419.
Gower, J. C.; Ross, G. J. S. (1969). "Minimum Spanning Trees and Single Linkage Cluster Analysis". Journal of the Royal Statistical Society. C (Applied Statistics). 18 (1): 54–64. doi:10.2307/2346439. JSTOR 2346439.
Päivinen, Niina (1 May 2005). "Clustering with a minimum spanning tree of scale-free-like structure". Pattern Recognition Letters. 26 (7): 921–930. Bibcode:2005PaReL..26..921P. doi:10.1016/j.patrec.2004.09.039.
Xu, Y.; Olman, V.; Xu, D. (1 April 2002). "Clustering gene expression data using a graph-theoretic approach: an application of minimum spanning trees". Bioinformatics. 18 (4): 536–545. doi:10.1093/bioinformatics/18.4.536. PMID 12016051.
Dalal, Yogen K.; Metcalfe, Robert M. (1 December 1978). "Reverse path forwarding of broadcast packets". Communications of the ACM. 21 (12): 1040–1048. doi:10.1145/359657.359665. S2CID 5638057.
Ma, B.; Hero, A.; Gorman, J.; Michel, O. (2000). Image registration with minimum spanning tree algorithm (PDF). International Conference on Image Processing. Vol. 1. pp. 481–484. doi:10.1109/ICIP.2000.901000. Archived (PDF) from the original on 2022-10-09.
Suk, Minsoo; Song, Ohyoung (1 June 1984). "Curvilinear feature extraction using minimum spanning trees". Computer Vision, Graphics, and Image Processing. 26 (3): 400–411. doi:10.1016/0734-189X(84)90221-4.
Ohlsson, H. (2004). Implementation of low complexity FIR filters using a minimum spanning tree. 12th IEEE Mediterranean Electrotechnical Conference (MELECON 2004). Vol. 1. pp. 261–264. doi:10.1109/MELCON.2004.1346826.
Assunção, R. M.; M. C. Neves; G. Câmara; C. Da Costa Freitas (2006). "Efficient regionalization techniques for socio-economic geographical units using minimum spanning trees". International Journal of Geographical Information Science. 20 (7): 797–811. Bibcode:2006IJGIS..20..797A. doi:10.1080/13658810600665111. S2CID 2530748.
Devillers, J.; Dore, J.C. (1 April 1989). "Heuristic potency of the minimum spanning tree (MST) method in toxicology". Ecotoxicology and Environmental Safety. 17 (2): 227–235. Bibcode:1989EcoES..17..227D. doi:10.1016/0147-6513(89)90042-0. PMID 2737116.
Mori, H.; Tsuzuki, S. (1 May 1991). "A fast method for topological observability analysis using a minimum spanning tree technique". IEEE Transactions on Power Systems. 6 (2): 491–500. Bibcode:1991ITPSy...6..491M. doi:10.1109/59.76691.
Filliben, James J.; Kafadar, Karen; Shier, Douglas R. (1 January 1983). "Testing for homogeneity of two-dimensional surfaces". Mathematical Modelling. 4 (2): 167–189. doi:10.1016/0270-0255(83)90026-X.

dtic.mil (Global: 934^th place; English: 530^th place)

apps.dtic.mil

Nicos Christofides, Worst-case analysis of a new heuristic for the travelling salesman problem, Report 388, Graduate School of Industrial Administration, CMU, 1976.

dtic.mil

Kalaba, Robert E. (1963), Graph Theory and Automatic Control (PDF), archived from the original (PDF) on February 21, 2016

forth.gr (Global: low place; English: low place)

ics.forth.gr

Spira, P. M.; Pan, A. (1975), "On finding and updating spanning trees and shortest paths" (PDF), SIAM Journal on Computing, 4 (3): 375–380, doi:10.1137/0204032, MR 0378466.

fu-berlin.de (Global: 3,170^th place; English: 4,291^st place)

page.mi.fu-berlin.de

Tapia, Ernesto; Rojas, Raúl (2004). "Recognition of On-line Handwritten Mathematical Expressions Using a Minimum Spanning Tree Construction and Symbol Dominance" (PDF). Graphics Recognition. Recent Advances and Perspectives. Lecture Notes in Computer Science. Vol. 3088. Berlin Heidelberg: Springer-Verlag. pp. 329–340. ISBN 978-3-540-22478-5. Archived (PDF) from the original on 2022-10-09.

ghostarchive.org (Global: 64^th place; English: 28^th place)

Ma, B.; Hero, A.; Gorman, J.; Michel, O. (2000). Image registration with minimum spanning tree algorithm (PDF). International Conference on Image Processing. Vol. 1. pp. 481–484. doi:10.1109/ICIP.2000.901000. Archived (PDF) from the original on 2022-10-09.
Tapia, Ernesto; Rojas, Raúl (2004). "Recognition of On-line Handwritten Mathematical Expressions Using a Minimum Spanning Tree Construction and Symbol Dominance" (PDF). Graphics Recognition. Recent Advances and Perspectives. Lecture Notes in Computer Science. Vol. 3088. Berlin Heidelberg: Springer-Verlag. pp. 329–340. ISBN 978-3-540-22478-5. Archived (PDF) from the original on 2022-10-09.

jstor.org (Global: 23^rd place; English: 15^th place)

Hu, T. C. (1961), "The maximum capacity route problem", Operations Research, 9 (6): 898–900, doi:10.1287/opre.9.6.898, JSTOR 167055.
Gower, J. C.; Ross, G. J. S. (1969). "Minimum Spanning Trees and Single Linkage Cluster Analysis". Journal of the Royal Statistical Society. C (Applied Statistics). 18 (1): 54–64. doi:10.2307/2346439. JSTOR 2346439.

networkx.org (Global: low place; English: low place)

"networkx.algorithms.tree.mst.minimum_spanning_edges". NetworkX 2.6.2 documentation. Retrieved 2021-12-13. A minimum spanning tree is a subgraph of the graph (a tree) with the minimum sum of edge weights. A spanning forest is a union of the spanning trees for each connected component of the graph.

nih.gov (Global: 5^th place; English: 5^th place)

pubmed.ncbi.nlm.nih.gov

Simas, Tiago; Correia, Rion B.; Rocha, Luis M. (2021), "The distance backbone of complex networks", Journal of Complex Networks, 9 (6) cnab021, arXiv:2103.04668, doi:10.1093/comnet/cnab021, PMID 38348382.
Rozum, Jordan C.; Rocha, Luis M. (2021), "The ultrametric backbone is the union of all minimum spanning forests", Journal of Physics: Complexity, 5 (3): 035009, doi:10.1088/2632-072X/ad679e, PMID 39131403. This article incorporates text from this source, which is available under the CC BY 4.0 license.
Sneath, P. H. A. (1 August 1957). "The Application of Computers to Taxonomy". Journal of General Microbiology. 17 (1): 201–226. doi:10.1099/00221287-17-1-201. PMID 13475686.
Xu, Y.; Olman, V.; Xu, D. (1 April 2002). "Clustering gene expression data using a graph-theoretic approach: an application of minimum spanning trees". Bioinformatics. 18 (4): 536–545. doi:10.1093/bioinformatics/18.4.536. PMID 12016051.
Devillers, J.; Dore, J.C. (1 April 1989). "Heuristic potency of the minimum spanning tree (MST) method in toxicology". Ecotoxicology and Environmental Safety. 17 (2): 227–235. Bibcode:1989EcoES..17..227D. doi:10.1016/0147-6513(89)90042-0. PMID 2737116.

purdue.edu (Global: 1,391^st place; English: 979^th place)

docs.lib.purdue.edu

Frederickson, Greg N. (1997), "Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees", SIAM Journal on Computing, 26 (2): 484–538, doi:10.1137/S0097539792226825, MR 1438526.

researchgate.net (Global: 96^th place; English: 89^th place)

Djauhari, M., & Gan, S. (2015). Optimality problem of network topology in stocks market analysis. Physica A: Statistical Mechanics and Its Applications, 419, 108–114.

scipy.org (Global: low place; English: low place)

docs.scipy.org

"scipy.sparse.csgraph.minimum_spanning_tree - SciPy v1.7.1 Manual". Numpy and Scipy Documentation — Numpy and Scipy documentation. Retrieved 2021-12-10. A minimum spanning tree is a graph consisting of the subset of edges which together connect all connected nodes, while minimizing the total sum of weights on the edges.

semanticscholar.org (Global: 15^th place; English: 8^th place)

api.semanticscholar.org

Pettie, Seth; Ramachandran, Vijaya (2002), "An optimal minimum spanning tree algorithm" (PDF), Journal of the Association for Computing Machinery, 49 (1): 16–34, doi:10.1145/505241.505243, MR 2148431, S2CID 5362916.
Karger, David R.; Klein, Philip N.; Tarjan, Robert E. (1995), "A randomized linear-time algorithm to find minimum spanning trees", Journal of the Association for Computing Machinery, 42 (2): 321–328, doi:10.1145/201019.201022, MR 1409738, S2CID 832583
Chazelle, Bernard (2000), "A minimum spanning tree algorithm with inverse-Ackermann type complexity", Journal of the Association for Computing Machinery, 47 (6): 1028–1047, doi:10.1145/355541.355562, MR 1866456, S2CID 6276962.
Chazelle, Bernard (2000), "The soft heap: an approximate priority queue with optimal error rate", Journal of the Association for Computing Machinery, 47 (6): 1012–1027, doi:10.1145/355541.355554, MR 1866455, S2CID 12556140.
Fredman, M. L.; Tarjan, R. E. (1987). "Fibonacci heaps and their uses in improved network optimization algorithms". Journal of the ACM. 34 (3): 596. doi:10.1145/28869.28874. S2CID 7904683.
Gabow, H. N.; Galil, Z.; Spencer, T.; Tarjan, R. E. (1986). "Efficient algorithms for finding minimum spanning trees in undirected and directed graphs". Combinatorica. 6 (2): 109. doi:10.1007/bf02579168. S2CID 35618095.
Chong, Ka Wong; Han, Yijie; Lam, Tak Wah (2001), "Concurrent threads and optimal parallel minimum spanning trees algorithm", Journal of the Association for Computing Machinery, 48 (2): 297–323, doi:10.1145/375827.375847, MR 1868718, S2CID 1778676.
Eppstein, David (1992), "Finding the k smallest spanning trees", BIT, 32 (2): 237–248, doi:10.1007/BF01994879, MR 1172188, S2CID 121160520.
Jothi, Raja; Raghavachari, Balaji (2005), "Approximation Algorithms for the Capacitated Minimum Spanning Tree Problem and Its Variants in Network Design", ACM Trans. Algorithms, 1 (2): 265–282, doi:10.1145/1103963.1103967, S2CID 8302085
Holm, Jacob; de Lichtenberg, Kristian; Thorup, Mikkel (2001), "Poly-logarithmic deterministic fully dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity", Journal of the Association for Computing Machinery, 48 (4): 723–760, doi:10.1145/502090.502095, MR 2144928, S2CID 7273552.
Graham, R. L.; Hell, Pavol (1985), "On the history of the minimum spanning tree problem", Annals of the History of Computing, 7 (1): 43–57, Bibcode:1985IAHC....7a..43G, doi:10.1109/MAHC.1985.10011, MR 0783327, S2CID 10555375
Dalal, Yogen K.; Metcalfe, Robert M. (1 December 1978). "Reverse path forwarding of broadcast packets". Communications of the ACM. 21 (12): 1040–1048. doi:10.1145/359657.359665. S2CID 5638057.
Assunção, R. M.; M. C. Neves; G. Câmara; C. Da Costa Freitas (2006). "Efficient regionalization techniques for socio-economic geographical units using minimum spanning trees". International Journal of Geographical Information Science. 20 (7): 797–811. Bibcode:2006IJGIS..20..797A. doi:10.1080/13658810600665111. S2CID 2530748.

siam.org (Global: 9,070^th place; English: 5,832^nd place)

epubs.siam.org

Cheriton, David; Tarjan, Robert Endre (December 1976). "Finding Minimum Spanning Trees". SIAM Journal on Computing. 5 (4): 724–742. doi:10.1137/0205051. ISSN 0097-5397.

stackexchange.com (Global: 4,114^th place; English: 3,027^th place)

cs.stackexchange.com

"Do the minimum spanning trees of a weighted graph have the same number of edges with a given weight?". cs.stackexchange.com. Retrieved 4 April 2018.

ucalgary.ca (Global: 3,492^nd place; English: 2,416^th place)

pages.cpsc.ucalgary.ca

"Archived copy" (PDF). Archived from the original (PDF) on 2013-06-12. Retrieved 2014-07-02.{{cite web}}: CS1 maint: archived copy as title (link)

umich.edu (Global: 429^th place; English: 307^th place)

web.eecs.umich.edu

Pettie, Seth; Ramachandran, Vijaya (2002), "An optimal minimum spanning tree algorithm" (PDF), Journal of the Association for Computing Machinery, 49 (1): 16–34, doi:10.1145/505241.505243, MR 2148431, S2CID 5362916.
Ma, B.; Hero, A.; Gorman, J.; Michel, O. (2000). Image registration with minimum spanning tree algorithm (PDF). International Conference on Image Processing. Vol. 1. pp. 481–484. doi:10.1109/ICIP.2000.901000. Archived (PDF) from the original on 2022-10-09.

eecs.umich.edu

Pettie, Seth; Ramachandran, Vijaya (2002), "A randomized time-work optimal parallel algorithm for finding a minimum spanning forest" (PDF), SIAM Journal on Computing, 31 (6): 1879–1895, doi:10.1137/S0097539700371065, MR 1954882.

upenn.edu (Global: 784^th place; English: 498^th place)

seas.upenn.edu

McDonald, Ryan; Pereira, Fernando; Ribarov, Kiril; Hajič, Jan (2005). "Non-projective dependency parsing using spanning tree algorithms" (PDF). Proc. HLT/EMNLP.

web.archive.org (Global: 1^st place; English: 1^st place)

"Archived copy" (PDF). Archived from the original (PDF) on 2013-06-12. Retrieved 2014-07-02.{{cite web}}: CS1 maint: archived copy as title (link)
Dahlhaus, E.; Johnson, D. S.; Papadimitriou, C. H.; Seymour, P. D.; Yannakakis, M. (August 1994). "The complexity of multiterminal cuts" (PDF). SIAM Journal on Computing. 23 (4): 864–894. doi:10.1137/S0097539792225297. Archived from the original (PDF) on 24 August 2004. Retrieved 17 December 2012.
Kalaba, Robert E. (1963), Graph Theory and Automatic Control (PDF), archived from the original (PDF) on February 21, 2016

worldcat.org (Global: 4^th place; English: 4^th place)

search.worldcat.org

Matsui, Tomomi (1995-03-10). "The minimum spanning tree problem on a planar graph". Discrete Applied Mathematics. 58 (1): 91–94. doi:10.1016/0166-218X(94)00095-U. ISSN 0166-218X.
Cheriton, David; Tarjan, Robert Endre (December 1976). "Finding Minimum Spanning Trees". SIAM Journal on Computing. 5 (4): 724–742. doi:10.1137/0205051. ISSN 0097-5397.
Garey, Michael R.; Johnson, David S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. Series of Books in the Mathematical Sciences (1st ed.). New York: W. H. Freeman and Company. ISBN 978-0-7167-1045-5. MR 0519066. OCLC 247570676.. ND12

zenodo.org (Global: 737^th place; English: 426^th place)

Assunção, R. M.; M. C. Neves; G. Câmara; C. Da Costa Freitas (2006). "Efficient regionalization techniques for socio-economic geographical units using minimum spanning trees". International Journal of Geographical Information Science. 20 (7): 797–811. Bibcode:2006IJGIS..20..797A. doi:10.1080/13658810600665111. S2CID 2530748.

Minimum spanning tree (English Wikipedia)

acm.org (Global: 1,200th place; English: 821st place)

portal.acm.org

dl.acm.org

adsabs.harvard.edu (Global: 14th place; English: 9th place)

ui.adsabs.harvard.edu

ams.org (Global: 434th place; English: 249th place)

mathscinet.ams.org

arxiv.org (Global: 49th place; English: 31st place)

att.com (Global: low place; English: 7,681st place)

akpublic.research.att.com

blogspot.ru (Global: 7,461st place; English: low place)

flashing-thoughts.blogspot.ru

books.google.com (Global: 3rd place; English: 3rd place)

creativecommons.org (Global: 580th place; English: 287th place)

doi.org (Global: 2nd place; English: 2nd place)

dtic.mil (Global: 934th place; English: 530th place)

apps.dtic.mil

dtic.mil

forth.gr (Global: low place; English: low place)

ics.forth.gr

fu-berlin.de (Global: 3,170th place; English: 4,291st place)

page.mi.fu-berlin.de

ghostarchive.org (Global: 64th place; English: 28th place)

jstor.org (Global: 23rd place; English: 15th place)

networkx.org (Global: low place; English: low place)

nih.gov (Global: 5th place; English: 5th place)

pubmed.ncbi.nlm.nih.gov

purdue.edu (Global: 1,391st place; English: 979th place)

docs.lib.purdue.edu

researchgate.net (Global: 96th place; English: 89th place)

scipy.org (Global: low place; English: low place)

docs.scipy.org

semanticscholar.org (Global: 15th place; English: 8th place)

api.semanticscholar.org

siam.org (Global: 9,070th place; English: 5,832nd place)

epubs.siam.org

stackexchange.com (Global: 4,114th place; English: 3,027th place)

cs.stackexchange.com

ucalgary.ca (Global: 3,492nd place; English: 2,416th place)

pages.cpsc.ucalgary.ca

umich.edu (Global: 429th place; English: 307th place)

web.eecs.umich.edu

eecs.umich.edu

upenn.edu (Global: 784th place; English: 498th place)

seas.upenn.edu

web.archive.org (Global: 1st place; English: 1st place)

worldcat.org (Global: 4th place; English: 4th place)

search.worldcat.org

zenodo.org (Global: 737th place; English: 426th place)

acm.org (Global: 1,200^th place; English: 821^st place)

adsabs.harvard.edu (Global: 14^th place; English: 9^th place)

ams.org (Global: 434^th place; English: 249^th place)

arxiv.org (Global: 49^th place; English: 31^st place)

att.com (Global: low place; English: 7,681^st place)

blogspot.ru (Global: 7,461^st place; English: low place)

books.google.com (Global: 3^rd place; English: 3^rd place)

creativecommons.org (Global: 580^th place; English: 287^th place)

doi.org (Global: 2^nd place; English: 2^nd place)

dtic.mil (Global: 934^th place; English: 530^th place)

fu-berlin.de (Global: 3,170^th place; English: 4,291^st place)

ghostarchive.org (Global: 64^th place; English: 28^th place)

jstor.org (Global: 23^rd place; English: 15^th place)

nih.gov (Global: 5^th place; English: 5^th place)

purdue.edu (Global: 1,391^st place; English: 979^th place)

researchgate.net (Global: 96^th place; English: 89^th place)

semanticscholar.org (Global: 15^th place; English: 8^th place)

siam.org (Global: 9,070^th place; English: 5,832^nd place)

stackexchange.com (Global: 4,114^th place; English: 3,027^th place)

ucalgary.ca (Global: 3,492^nd place; English: 2,416^th place)

umich.edu (Global: 429^th place; English: 307^th place)

upenn.edu (Global: 784^th place; English: 498^th place)

web.archive.org (Global: 1^st place; English: 1^st place)

worldcat.org (Global: 4^th place; English: 4^th place)

zenodo.org (Global: 737^th place; English: 426^th place)