Author:
Zhong Caiming,Malinen Mikko,Miao Duoqian,Fränti Pasi
Funder
Natural Science Foundation of China
Center for International Mobility
K.C. Wong Magna Fund
Subject
Artificial Intelligence,Information Systems and Management,Computer Science Applications,Theoretical Computer Science,Control and Systems Engineering,Software
Reference54 articles.
1. A simple algorithm for computing minimum spanning trees in the internet;Abdel-Wahab;Inform. Sci.,1997
2. A fast implementation of the minimum spanning tree method for phase unwrapping;An;IEEE Trans. Med. Imag.,2000
3. B. Awerbuch, Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems, in: Proceedings of the 19th ACM Symposium on Theory of Computing, 1987.
4. Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs;Bader;J. Paral. Distrib. Comput.,2006
5. Some new indexes of cluster validity;Bezdek;IEEE Trans. Syst., Man Cybernet., Part B,1998
Cited by
71 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献