Abstract: One of the most common and well-known problems in combinatorial optimization is the minimum spanning tree. With the emergence of complex data structures, new, more complex, but ...

It is known that the GMST problem belongs to the hard core of NP-hard problems. The aim of this paper is to present an exact exponential time algorithm for the GMST problem as well three efficient ...