Minimum-Cost Spanning Tree as a Path-Finding Problem

@article{Maggs1988MinimumCostST,
  title={Minimum-Cost Spanning Tree as a Path-Finding Problem},
  author={Bruce M. Maggs and Serge A. Plotkin},
  journal={Inf. Process. Lett.},
  year={1988},
  volume={26},
  pages={291-293}
}
In this paper we show that minimum-cost spanning tree is a special case of the closed semiring path-nding problem. This observation gives us a non-recursive algorithm for nding minimum-cost spanning trees on mesh-connected computers that has the same asymptotic running time but is much simpler than the previous recursive algorithms.