Many-to-many \(n\)-disjoint path covers in \(n\)-dimensional hypercubes (Q765483)
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 6016038
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Many-to-many \(n\)-disjoint path covers in \(n\)-dimensional hypercubes |
scientific article; zbMATH DE number 6016038 |
Statements
Many-to-many \(n\)-disjoint path covers in \(n\)-dimensional hypercubes (English)
0 references
19 March 2012
0 references
interconnection networks
0 references
hypercubes
0 references
disjoint paths
0 references
parallel computing
0 references
0 references
0.920497179031372
0 references
0.8611305952072144
0 references
0.857904314994812
0 references
0.8529356718063354
0 references
0.8526169061660767
0 references
