The expected complexity of Prim s minimum spanning tree algorithm

Charles U. Martel. The expected complexity of Prim s minimum spanning tree algorithm. Inf. Process. Lett., 81(4):197-201, 2002. [doi]

Abstract

Abstract is missing.