Minimum spanning tree is a classical problem in graph theory that plays a key role in a broad domain of applications. This paper proposes a minimum spanning tree algorithm using Prim’s approach ...

The aim of this paper is to present an exact exponential time algorithm for the GMST problem as well three efficient algorithms, two of them based on Prim's and Kruskal's algorithms for the minimum ...