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

From MaRDI portal
Revision as of 23:02, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(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

    Node-and edge-deletion NP-complete problems (English)
    0 references
    0 references
    0 references
    14 March 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    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
    0 references
    0 references