A new algorithm for minimum spanning tree using depth-first-search in an undirected graph

H. Salehi Fathabadi, H. Ahrabian. A new algorithm for minimum spanning tree using depth-first-search in an undirected graph. Int. J. Comput. Math., 57(3-4):157-161, 1995. [doi]

Abstract

Abstract is missing.