Seunghwa Kang, David A. Bader
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
PPoPP, 2009.
@inproceedings{PPoPP-2009-KangB, author = "Seunghwa Kang and David A. Bader", booktitle = "{Proceedings of the 14th Symposium on Principles and Practice of Parallel Programming}", doi = "10.1145/1504176.1504182", isbn = "978-1-60558-397-6", pages = "15--24", publisher = "{ACM}", title = "{An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs}", year = 2009, }