Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs

DOI10.1016/j.jpdc.2006.06.001zbMath1110.68091DBLPjournals/jpdc/BaderC06OpenAlexW1972786931WikidataQ55951523 ScholiaQ55951523MaRDI QIDQ861311

David A. Bader, Guojing Cong

Publication date: 9 January 2007

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2006.06.001

zbMATH Keywords

connectivityparallel graph algorithmshigh-performance algorithm engineering

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

A fast minimum spanning tree algorithm based on \(K\)-means

This page was built for publication: Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs