NP-completeness for minimizing maximum edge length in grid embeddings (Q3677185)

From MaRDI portal
Revision as of 15:25, 13 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/jal/MillerO85, #quickstatements; #temporary_batch_1731505720702)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
NP-completeness for minimizing maximum edge length in grid embeddings
scientific article

    Statements

    title
    NP-completeness for minimizing maximum edge length in grid embeddings (English)
    0 references
    publication date
    1985
    0 references
    zbMATH Keywords
    combinatorial optimization
    0 references
    graph embeddings
    0 references
    two-dimensional lattice
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68R10
    0 references
    68Q25
    0 references
    05C10
    0 references
    zbMATH DE Number
    3898254
    0 references
    Wikidata QID
    Q59592734
    0 references
    OpenAlex ID
    W2117771589
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3677185&oldid=37906848"
    Powered by MediaWiki