An efficient algorithm to construct disjoint path covers of DCell networks (Q897875)

From MaRDI portal
Revision as of 04:46, 11 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
An efficient algorithm to construct disjoint path covers of DCell networks
scientific article

    Statements

    An efficient algorithm to construct disjoint path covers of DCell networks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    8 December 2015
    0 references
    data center network
    0 references
    DCell network
    0 references
    disjoint path cover
    0 references
    Hamiltonian path
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references