Minimum spanning tree (Simple English Wikipedia)

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

Last modified: 20:10:28, 29 January 2024 (UTC)

Ref.Un. Ref.Website

Global rank Simple English rank

1,200^th place

964^th place

2^nd place

2^nd place

acm.org (Global: 1,200^th place; Simple English: 964^th place)

doi.acm.org

Chazelle, B. 2000. A minimum spanning tree algorithm with inverse-Ackermann type complexity. J. ACM 47, 6 (Nov. 2000), 1028-1047.
Chazelle, B. 2000. The soft heap: an approximate priority queue with optimal error rate. J. ACM 47, 6 (Nov. 2000), 1012-1027.
Karger, D. R., Klein, P. N., and Tarjan, R. E. 1995. A randomized linear-time algorithm to find minimum spanning trees. J. ACM 42, 2 (Mar. 1995), 321-328.

portal.acm.org

Pettie, S. and Ramachandran, V. 2002. Minimizing randomness in minimum spanning tree, parallel connectivity, and set maxima algorithms. In Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (San Francisco, California, January 06 - 08, 2002). Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, PA, 713-722.

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

dx.doi.org

Fredman, M. L. and Willard, D. E. 1994. Trans-dichotomous algorithms for minimum spanning trees and shortest paths. J. Comput. Syst. Sci. 48, 3 (Jun. 1994), 533-551.