Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs (Extended Abstract)

David A. Bader, Guojing Cong

Research output: Chapter in Book/Report/Conference proceedingConference contribution

37 Scopus citations

Fingerprint

Dive into the research topics of 'Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs (Extended Abstract)'. Together they form a unique fingerprint.

Engineering & Materials Science