Many-to-many disjoint path covers in \(k\)-ary \(n\)-cubes (Q387813)

From MaRDI portal
Revision as of 07:58, 29 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q1721718)
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
    0 references
    17 December 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    interconnection networks
    0 references
    \(k\)-ary \(n\)-cubes
    0 references
    disjoint paths
    0 references
    parallel computing
    0 references