Many-to-many disjoint path covers in \(k\)-ary \(n\)-cubes (Q387813): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2013.04.002 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2074859967 / rank | |||
Normal rank |
Revision as of 21:47, 19 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