Title
Algorithms for the degree-constrained minimum spanning tree and the hierarchical clustering problems using the nearest-neighbor techniques
Keywords
Cluster analysis, Parallel algorithms
Notes
This item is only available in print in the UCF Libraries. If this is your thesis or dissertation, you can help us make it available online for use by researchers around the world by downloading and filling out the Internet Distribution Consent Agreement. You may also contact the project coordinator Kerri Bottorff for more information.
Graduation Date
1999
Semester
Spring
Advisor
Lang, S. D.
Degree
Doctor of Philosophy (Ph.D.)
College
College of Arts and Sciences
Department
Computer Science
Format
Language
English
Length of Campus-only Access
None
Access Status
Doctoral Dissertation (Open Access)
Subjects
Arts and Sciences -- Dissertations, Academic; Dissertations, Academic -- Arts and Sciences
STARS Citation
Mao, Li Jen, "Algorithms for the degree-constrained minimum spanning tree and the hierarchical clustering problems using the nearest-neighbor techniques" (1999). Retrospective Theses and Dissertations. 2184.
https://stars.library.ucf.edu/rtd/2184