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

Seunghwa Kang, David A. Bader

Research output: Contribution to journal › Article › peer-review

8 Scopus citations

Fingerprint

Dive into the research topics of 'An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs'. Together they form a unique fingerprint.

Keyphrases

Computer Science