Hardness of subgraph and supergraph problems in \(c\)-tournaments (Q638528)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Hardness of subgraph and supergraph problems in \(c\)-tournaments |
scientific article; zbMATH DE number 5947161
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hardness of subgraph and supergraph problems in \(c\)-tournaments |
scientific article; zbMATH DE number 5947161 |
Statements
Hardness of subgraph and supergraph problems in \(c\)-tournaments (English)
0 references
12 September 2011
0 references
parameterized complexity
0 references
feedback vertex set
0 references
dominating set
0 references
graph modification
0 references
tournaments
0 references
