Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs (Q1944080)
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 6150261
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs |
scientific article; zbMATH DE number 6150261 |
Statements
Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs (English)
0 references
4 April 2013
0 references
independent spanning trees
0 references
fault-tolerant broadcasting
0 references
parallel algorithms
0 references
Cartesian product
0 references
generalized base-b hypercube
0 references
0 references
0 references
0 references
0 references
0 references
0.8257874250411987
0 references
0.822472870349884
0 references
0.8209449648857117
0 references
0.8208450675010681
0 references
0.8169164657592773
0 references
