1. Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Minimum spanning trees. Introduction to Algorithms, 2nd edn, pp. 561–579. MIT Press and McGraw-Hill, Cambridge (2001). Chap. 23
2. Rubanov, L.I., Seliverstov, A.V., Zverkov, O.A.: Ultraconservative elements in the simplest of subtype Alveolata. Modern Inf. Technol. IT Educ. 2, 581–585 (2015)
3. Eisner, J.: State-of-the-art algorithms for minimum spanning trees. A Tutorial Discussion, University of Pennsylvania (1997)
4. Prim, R.C.: Shortest connection networks and some generalizations. Bell Syst. Tech. J. 36, 1389–1401 (1957)
5. Kruskal, J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem. AMS 7, 48–50 (1956)