A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube (Q4876698)

From MaRDI portal
Revision as of 01:27, 11 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article; zbMATH DE number 874106
Language Label Description Also known as
English
A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube
scientific article; zbMATH DE number 874106

    Statements

    A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube (English)
    0 references
    0 references
    0 references
    6 May 1996
    0 references
    binary hypercube
    0 references
    parallel computation
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references