ON THE COMPUTATIONAL COMPLEXITY OF ROUTING IN FAULTY K-ARY N-CUBES AND HYPERCUBES (Q3144931)

From MaRDI portal
Revision as of 23:16, 5 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    12 December 2012
    0 references
    routing
    0 references
    computational complexity
    0 references
    \(k\)-ary \(n\)-cubes
    0 references
    hypercubes
    0 references

    Identifiers