Minimal spanning trees: An empirical investigation of parallel algorithms (Q1823705)
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: Minimal spanning trees: An empirical investigation of parallel algorithms |
scientific article; zbMATH DE number 4115991
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimal spanning trees: An empirical investigation of parallel algorithms |
scientific article; zbMATH DE number 4115991 |
Statements
Minimal spanning trees: An empirical investigation of parallel algorithms (English)
0 references
1989
0 references
minimum spanning tree problem
0 references
graph theory
0 references
performance
0 references
measurements
0 references
Prim's algorithm
0 references
Sollin's algorithm
0 references
Kruskal's algorithm
0 references
Sequent Symmetry S81 multicomputer
0 references
0.8541891574859619
0 references
0.8540074229240417
0 references
0.8445898294448853
0 references
0.8441562056541443
0 references
