1. Dagar, S.: Modified Prim’s algorithm. IJCIT 03(02) (2012). ISSN 2218-5224
2. Eisner, J.: State of the art algorithms for minimum spanning trees a tutorial discussion (1997).
3. Karger, D.R., Tarjan, R.E., Klein, P.N.: A randomized linear-time algorithm to find minimum spanning trees. J. ACM 42(2), 321–328 (1995)
4. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms (3rd edn.). PHI Learning Private Ltd., pp. 624–642 (2009)
5. Mehlhorn, K., Sanders, P.: Algorithms and Data Structures: The Basic Toolbox. Springer, Berlin (2008)