Many-to-many disjoint path covers in \(k\)-ary \(n\)-cubes (Q387813): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 01:08, 5 March 2024
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
