Unit disk graph recognition is NP-hard (Q1384186)

From MaRDI portal
Revision as of 11:07, 28 May 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
Unit disk graph recognition is NP-hard
scientific article

    Statements

    title
    Unit disk graph recognition is NP-hard (English)
    0 references
    author
    Heinz Breu
    0 references
    David G. Kirkpatrick
    0 references
    publication date
    13 April 1998
    0 references
    zbMATH Keywords
    disk intersection graphs
    0 references
    disk touching graphs
    0 references
    unit disk graphs
    0 references
    SATISFIABILITY
    0 references

    Identifiers

    zbMATH DE Number
    1140201
    0 references
    Wikidata QID
    Q29028109
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1384186&oldid=34199769"
    Powered by MediaWiki