The minimal spanning tree and cluster analysis
Date
10-1992
Degree
Bachelor of Science in Applied Mathematics
College
College of Arts and Sciences (CAS)
Adviser/Committee Chair
Rolando E. Ramos
Abstract
The Minimal Spanning Tree Problem is a problem of finding a spanning tree of a graph such that the total weight of the tree is the least compared to all the other spanning trees of the graph. The minimal spanning tree has various uses and applications. It is often used in obtaining an optimal network design. Cluster Analysis is another area of application of the minimal spanning tree. There are several minimal spanning tree algorithms. Among the popular ones are Prim's algorithm, Kruskal's algorithm and Serge's algorithm. These algorithm were analyzed and compared in terms or their time of spore complexities. Prim's Algorithm is more preferred for dense complete graphs. A cluster analysis as software was developed using the minimal spanning tree as the clustering method. Prim's algorithm selected to to used in the software.
Language
English
Location
UPLB Main Library Special Collections Section (USCS)
Call Number
Thesis
Recommended Citation
Unida, Ana Corinna C., "The minimal spanning tree and cluster analysis" (1992). Undergraduate Theses. 10179.
https://www.ukdr.uplb.edu.ph/etd-undergrad/10179
Document Type
Thesis