Seunghwa Kang, David A. Bader. An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs. In Daniel A. Reed, Vivek Sarkar, editors, Proceedings of the 14th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP 2009, Raleigh, NC, USA, February 14-18, 2009. pages 15-24, ACM, 2009. [doi]
@inproceedings{KangB09,
title = {An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs},
author = {Seunghwa Kang and David A. Bader},
year = {2009},
doi = {10.1145/1504176.1504182},
url = {http://doi.acm.org/10.1145/1504176.1504182},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/KangB09},
cites = {0},
citedby = {0},
pages = {15-24},
booktitle = {Proceedings of the 14th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP 2009, Raleigh, NC, USA, February 14-18, 2009},
editor = {Daniel A. Reed and Vivek Sarkar},
publisher = {ACM},
isbn = {978-1-60558-397-6},
}