Parameterized complexity of vertex deletion into perfect graph classes (Q392038)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6244637
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized complexity of vertex deletion into perfect graph classes |
scientific article; zbMATH DE number 6244637 |
Statements
Parameterized complexity of vertex deletion into perfect graph classes (English)
0 references
13 January 2014
0 references
parameterized complexity
0 references
perfect graphs
0 references
vertex deletion problems
0 references
kernelization
0 references
0.9975582361221312
0 references
0.8159911632537842
0 references
0.8109059929847717
0 references
0.8047615885734558
0 references
0.799554705619812
0 references
