Dense edge-disjoint embedding of complete binary trees in the hypercube (Q2365823)

From MaRDI portal
Revision as of 04:39, 22 February 2024 by RedirectionBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Dense edge-disjoint embedding of complete binary trees in the hypercube
scientific article

    Statements

    Dense edge-disjoint embedding of complete binary trees in the hypercube (English)
    0 references
    0 references
    0 references
    29 June 1993
    0 references
    parallel algorithms
    0 references
    graph embedding
    0 references
    complete binary tree
    0 references
    hybercube
    0 references

    Identifiers

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