An efficient parallel construction of optimal independent spanning trees on hypercubes (Q362597): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2018477012 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4414501 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Independent trees in graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Independent trees in planar graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4703869 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimum broadcasting and personalized communication in hypercubes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4232798 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4253362 / rank | |||
Normal rank | |||
Latest revision as of 19:26, 6 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient parallel construction of optimal independent spanning trees on hypercubes |
scientific article |
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
