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 this page instead for the normal view: Many-to-many disjoint path covers in \(k\)-ary \(n\)-cubes |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Many-to-many disjoint path covers in \(k\)-ary \(n\)-cubes |
scientific article |
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
