Zhong, Caiming
Malinen, Mikko
Miao, Duoqian
Fränti, Pasi
Funding for this research was provided by:
Natural Science Foundation of China (61175054)
Center for International Mobility
K.C. Wong Magna Fund
This article is maintained by: Elsevier
Article Title: A fast minimum spanning tree algorithm based on K-means
Journal Title: Information Sciences
CrossRef DOI link to publisher maintained version: https://doi.org/10.1016/j.ins.2014.10.012
Content Type: article
Copyright: Copyright © 2014 Elsevier Inc. All rights reserved.