ON THE COMPUTATIONAL COMPLEXITY OF ROUTING IN FAULTY K-ARY N-CUBES AND HYPERCUBES (Q3144931): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finding paths between 3-colorings / rank | |||
Normal rank | |||
Latest revision as of 23:16, 5 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | ON THE COMPUTATIONAL COMPLEXITY OF ROUTING IN FAULTY K-ARY N-CUBES AND HYPERCUBES |
scientific article |
Statements
ON THE COMPUTATIONAL COMPLEXITY OF ROUTING IN FAULTY K-ARY N-CUBES AND HYPERCUBES (English)
0 references
12 December 2012
0 references
routing
0 references
computational complexity
0 references
\(k\)-ary \(n\)-cubes
0 references
hypercubes
0 references
