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

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Shi-ying Wang / rank
Normal rank
 
Property / author
 
Property / author: Shi-ying Wang / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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
Property / cites work
 
Property / cites work: Lee distance and topological properties of k-ary n-cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many-to-many disjoint paths in faulty hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The two-equal-disjoint path cover problem of matching composition network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many-to-many \(n\)-disjoint path covers in \(n\)-dimensional hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding Hamiltonian paths in \(k\)-ary \(n\)-cubes with conditional edge faults / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:40, 7 July 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
    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
    0 references