Hardness of Approximation for <i>H</i> -free Edge Modification Problems (Q4973877): 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.1145/3196834 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2963777460 / rank | |||
Normal rank | |||
Latest revision as of 23:48, 19 March 2024
scientific article; zbMATH DE number 7140830
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hardness of Approximation for <i>H</i> -free Edge Modification Problems |
scientific article; zbMATH DE number 7140830 |
Statements
Hardness of Approximation for <i>H</i> -free Edge Modification Problems (English)
0 references
6 December 2019
0 references
\(H\)-free graphs
0 references
hardness of approximation
0 references
exponential time hypothesis
0 references
fixed-parameter tractability
0 references
graph modification problems
0 references
