1. K. Abrahamson, N. Dadoun, D.G. Kirkpatrick, T. Przytycka, A simple parallel tree contraction algorithm J. Algorithms 10 (1989) 287–302.
2. The Design and Analysis of Computer Algorithms;Aho,1974
3. Efficient parallel algorithms for some graph problems;Chin;Comm. ACM,1982
4. K.W. Chong, Y. Han, T.W. Lam, On the parallel time complexity of undirected connectivity and minimum spanning trees, Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, January, 1999, pp. 225–234.
5. R. Cole, P.N. Klein, R.E. Tarjan, A linear work parallel algorithm for minimum spanning trees, Proceedings of the Sixth Annual ACM Symposium on Parallel Algorithms and Architectures, June 1994, pp. 11–15.