Embedding Trees in a Hypercube is NP-Complete (Q3476279)

From MaRDI portal
Revision as of 06:55, 11 February 2024 by RedirectionBot (talk | contribs) (‎Removed claims)
scientific article
Language Label Description Also known as
English
Embedding Trees in a Hypercube is NP-Complete
scientific article

    Statements

    title
    Embedding Trees in a Hypercube is NP-Complete (English)
    0 references
    publication date
    1990
    0 references
    zbMATH Keywords
    multiprocessor
    0 references
    graph embedding
    0 references
    hypercube
    0 references
    NP-complete
    0 references

    Identifiers

    DOI
    10.1137/0219038
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    05C05
    0 references
    68N99
    0 references
    68N25
    0 references
    03D15
    0 references
    zbMATH DE Number
    4145341
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3476279&oldid=20584110"
    Powered by MediaWiki