| Minimum-Cost Spanning Tree as a Path-Finding Problem (1994) | |||||||||||||||
Abstract | |||||||||||||||
| In this paper we show that minimum-cost spanning tree is a special case of the closed semiring path-finding problem. This observation gives us a non-recursive algorithm for finding minimumcost spanning trees on mesh-connected computers that has the same asymptotic running time but is much simpler than the previous recursive algorithms. | |||||||||||||||
Details der Publikation | |||||||||||||||
| |||||||||||||||