Hardness of subgraph and supergraph problems in \(c\)-tournaments (Q638528)

From MaRDI portal
Revision as of 11:22, 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
Hardness of subgraph and supergraph problems in \(c\)-tournaments
scientific article

    Statements

    Hardness of subgraph and supergraph problems in \(c\)-tournaments (English)
    0 references
    0 references
    0 references
    12 September 2011
    0 references
    0 references
    parameterized complexity
    0 references
    feedback vertex set
    0 references
    dominating set
    0 references
    graph modification
    0 references
    tournaments
    0 references
    0 references