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 ...

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 ...

It is shown how a comparison of price levels across a group of countries can be made by chaining bilateral price indexes across a spanning tree. It is argued that we should use the spanning tree whose ...