Complexity dichotomy on partial grid recognition (Q533881)

From MaRDI portal
Revision as of 01:24, 4 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Complexity dichotomy on partial grid recognition
scientific article

    Statements

    title
    Complexity dichotomy on partial grid recognition (English)
    0 references
    publication date
    10 May 2011
    0 references
    zbMATH DE Number
    5886217
    0 references
    zbMATH Keywords
    graph embedding
    0 references
    VLSI layout
    0 references
    partial grid
    0 references
    NP-completeness
    0 references
    OpenAlex ID
    W1983471422
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q533881&oldid=35225953"
    Powered by MediaWiki