An efficient parallel construction of optimal independent spanning trees on hypercubes (Q362597)
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: An efficient parallel construction of optimal independent spanning trees on hypercubes |
scientific article; zbMATH DE number 6200490
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient parallel construction of optimal independent spanning trees on hypercubes |
scientific article; zbMATH DE number 6200490 |
Statements
An efficient parallel construction of optimal independent spanning trees on hypercubes (English)
0 references
22 August 2013
0 references
ISTs (independent spanning trees)
0 references
double pointer jumping
0 references
hypercube interconnection networks
0 references
reliable and fault-tolerant broadcasting
0 references
parallel computers
0 references
multicomputers
0 references
multicores
0 references
