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

These algorithms are significant because they can solve the noncommutative weighted Edmonds' problem in polynomial time, demonstrating that certain complex problems can be tackled efficiently [2].

Martin P. Tingley, Peter Huybers, A Bayesian Algorithm for Reconstructing Climate Anomalies in Space and Time. Part I, Journal of Climate, Vol. 23, No. 10 (15 May 2010), pp. 2759-2781 ...