Constructing the nearly shortest path in crossed cubes (Q2390375)

From MaRDI portal
Revision as of 20:07, 1 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
Constructing the nearly shortest path in crossed cubes
scientific article

    Statements

    Constructing the nearly shortest path in crossed cubes (English)
    0 references
    0 references
    0 references
    22 July 2009
    0 references
    0 references
    interconnection networks
    0 references
    crossed cubes
    0 references
    nearly shortest path
    0 references
    second shortest path
    0 references
    path embedding
    0 references
    0 references