Many-to-many disjoint path covers in \(k\)-ary \(n\)-cubes (Q387813)
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 6238867
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Many-to-many disjoint path covers in \(k\)-ary \(n\)-cubes |
scientific article; zbMATH DE number 6238867 |
Statements
Many-to-many disjoint path covers in \(k\)-ary \(n\)-cubes (English)
0 references
17 December 2013
0 references
interconnection networks
0 references
\(k\)-ary \(n\)-cubes
0 references
disjoint paths
0 references
parallel computing
0 references
0.8819519281387329
0 references
0.8545283079147339
0 references
0.8526169061660767
0 references
0.8514847755432129
0 references
0.8282995820045471
0 references
