Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs (Q861311)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs |
scientific article; zbMATH DE number 5083816
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs |
scientific article; zbMATH DE number 5083816 |
Statements
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs (English)
0 references
9 January 2007
0 references
parallel graph algorithms
0 references
connectivity
0 references
high-performance algorithm engineering
0 references
