An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Seunghwa Kang' in GoogleThis author has not been identified. Look up 'David A. Bader' in Google

runs on WebDSL