Minimum-Cost Spanning Tree as a Path-Finding Problem (1994)
by
Bruce M. Maggs
,
Serge A. Plotkin
| Venue: | Information Processing Letters |
| Citations: | 17 - 0 self |
BibTeX
@ARTICLE{Maggs94minimum-costspanning,
author = {Bruce M. Maggs and Serge A. Plotkin},
title = {Minimum-Cost Spanning Tree as a Path-Finding Problem},
journal = {Information Processing Letters},
year = {1994},
volume = {26},
pages = {291--293}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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.
