A parallel algorithm for constructing two edge-disjoint Hamiltonian cycles in crossed cubes (Q2039695)

From MaRDI portal
Revision as of 00:48, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
A parallel algorithm for constructing two edge-disjoint Hamiltonian cycles in crossed cubes
scientific article

    Statements

    A parallel algorithm for constructing two edge-disjoint Hamiltonian cycles in crossed cubes (English)
    0 references
    0 references
    5 July 2021
    0 references
    edge-disjoint Hamiltonian cycles
    0 references
    crossed cubes
    0 references
    interconnection networks
    0 references

    Identifiers

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