By Topic

Improved algorithm for the construction of minimal spanning trees

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $33
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
C. Pynn ; Plessey Telecommunications Group, Maidenhead, UK ; J. H. Warren

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.

Published in:

Electronics Letters  (Volume:8 ,  Issue: 6 )