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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68M14 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68M07 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68R10 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6238867 / rank
 
Normal rank
Property / zbMATH Keywords
 
interconnection networks
Property / zbMATH Keywords: interconnection networks / rank
 
Normal rank
Property / zbMATH Keywords
 
\(k\)-ary \(n\)-cubes
Property / zbMATH Keywords: \(k\)-ary \(n\)-cubes / rank
 
Normal rank
Property / zbMATH Keywords
 
disjoint paths
Property / zbMATH Keywords: disjoint paths / rank
 
Normal rank
Property / zbMATH Keywords
 
parallel computing
Property / zbMATH Keywords: parallel computing / rank
 
Normal rank

Revision as of 14:20, 29 June 2023

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
    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

    Identifiers