Two minimum spanning forest algorithms on fixed-size hypercube computers (Q916371)
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 4153879
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two minimum spanning forest algorithms on fixed-size hypercube computers |
scientific article; zbMATH DE number 4153879 |
Statements
Two minimum spanning forest algorithms on fixed-size hypercube computers (English)
0 references
1990
0 references
graph problems
0 references
parallel algorithms
0 references
minimum spanning forest
0 references
hypercube computers
0 references
0.9030357003211976
0 references
0.8565183281898499
0 references
0.8561435341835022
0 references
0.8529003858566284
0 references
0.8499991297721863
0 references
