http://iet.metastore.ingenta.com
1887

Improved algorithm for the construction of minimal spanning trees

Improved algorithm for the construction of minimal spanning trees

For access to this article, please select a purchase option:

Buy article PDF
$19.95
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

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.

References

    1. 1)
      • C.T. Zahn . Graph-theoretical methods for detecting and describing gestalt clusters. IEEE Trans. , 68 - 86
    2. 2)
      • R.C. Prim . Shortest connection networks and some generalisations. Bell Syst. Tech. J. , 1389 - 1401
    3. 3)
      • J.B. Kruskal . On the shortest spanning subtree of a graph and the travelling salesmanproblem. Proc. Am. Math. Soc. , 48 - 50
http://iet.metastore.ingenta.com/content/journals/10.1049/el_19720104
Loading

Related content

content/journals/10.1049/el_19720104
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address