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 the normal view instead:
scientific article; zbMATH DE number 5083816
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8499991297721863
0 references
0.849122166633606
0 references
0.8427032232284546
0 references
0.8404743671417236
0 references
0.8339511156082153
0 references
