Node-and edge-deletion NP-complete problems (Q5402565)

From MaRDI portal
Revision as of 16:36, 13 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): conf/stoc/Yannakakis78, #quickstatements; #temporary_batch_1731508824982)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6270125
Language Label Description Also known as
English
Node-and edge-deletion NP-complete problems
scientific article; zbMATH DE number 6270125

    Statements

    title
    Node-and edge-deletion NP-complete problems (English)
    0 references
    author
    Mihalis Yannakakis
    0 references
    publication date
    14 March 2014
    0 references
    zbMATH Keywords
    approximation
    0 references
    computational complexity
    0 references
    edge-deletion
    0 references
    graph
    0 references
    graph-property
    0 references
    hereditary
    0 references
    maximum subgraph
    0 references
    NP-complete
    0 references
    node-deletion
    0 references
    polynomial hierarchy
    0 references

    Identifiers

    DOI
    10.1145/800133.804355
    0 references
    Mathematics Subject Classification ID
    68Q17
    0 references
    05C35
    0 references
    03D15
    0 references
    05C85
    0 references
    68R10
    0 references
    zbMATH DE Number
    6270125
    0 references
    Wikidata QID
    Q56209809
    0 references
    OpenAlex ID
    W2045027193
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5402565&oldid=37909313"
    Powered by MediaWiki