Improved algorithm for the construction of minimal spanning trees

C. Pynn, J.H. Warren · Electronics Letters · 1972

An improved algorithm for the construction of minimal spanning trees is proposed which is particularly suitable for use with data sets containing repeated elements. The algorithm may be applied to cluster-detection and pattern-segmentation problems, such as arise in automatic speech recognition.

Read the paper · More papers on PaperTik