Hardness of subgraph and supergraph problems in \(c\)-tournaments (Q638528): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2011.04.046 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1966389676 / rank | |||
Normal rank |
Revision as of 02:41, 20 March 2024
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
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