Parallel Connectivity and Minimum Spanning Trees
Publisher
Springer New York
Reference11 articles.
1. Chong KW, Han Y, Lam TW (2001) Concurrent threads and optical parallel minimum spanning trees algorithm. J ACM 48(2):297–323
2. Cole R, Klein PN, Tarjan RE (1996) Finding minimum spanning forests in logarithmic time and linear work using random sampling. In: Proceedings of the 8th annual ACM symposium on parallel architectures and algorithms, Padua, pp 243–250
3. Cole R, Vishkin U (1986) Approximate and exact parallel scheduling with applications to list, tree, and graph problems. In: Proceedings of the 27th annual IEEE symposium on foundations of computer science, Toronto, pp 478–491
4. Cook SA, Dwork C, Reischuk R (1986) Upper and lower time bounds for parallel random access machines without simultaneous writes. SIAM J Comput 15(1):87–97
5. JáJá J (1992) An introduction to parallel algorithms. Addison-Wesley, Boston