2017/06/23 by Yong Kiam Tan, Tan, Yong
Computer Science · #05C05 #05C85 #Advanced Graph Theory Research #Combinatorics (math.CO) #Computational Geometry and Mesh Generation #Data Management and Algorithms #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #G.2.2
paper · pdf · doi:10.48550/arxiv.1706.07708
openalex publication_date 2017/06/23 · openalex created_date 2017/06/30 · openalex updated_date 2026/07/28
In this paper, we study the form over the minimum spanning tree problem (MST) from which we will derive an intuitively generalized model and new methods with the upper bound of runtimes of logarithm. The new pattern we made has taken successful to better equilibrium the benefits of local and global when we employ the strategy of divide and conquer to optimize solutions on problem. Under new model, we let the course of clustering become more transparent with many details, so that the whole solution may be featured of much reasonable, flexibility, efficiency and approach to reveal or reflect the reality. There are some important methods and avenues as fruits derived from discussions or trial which can be broad usefulness in the fields of graphic analysis, data mining, k-means clustering problem and so forth.