An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs

Cached

Download Links

by Seunghwa Kang , David A. Bader
Venue:In PPoPP ’09: Proceedings of the 14th ACM SIGPLAN Symposium on Principles
Citations:6 - 0 self