Skip to content

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

Seunghwa Kang, David A. Bader

VenueBPPoPP
Year2009
ProceedingsPPoPP

Browse the full PPoPP paper archive.