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

by S Kang, D A Bader
Venue:In Proc. of the Symp. on Prin. Prac. of Par. Prog., PPoPP ’09