Further parameterized algorithms for the \(\mathcal{F}\)-free edge deletion problem (Q2676471)
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: Further parameterized algorithms for the F-free edge deletion problem |
scientific article; zbMATH DE number 7593357
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Further parameterized algorithms for the \(\mathcal{F}\)-free edge deletion problem |
scientific article; zbMATH DE number 7593357 |
Statements
Further parameterized algorithms for the \(\mathcal{F}\)-free edge deletion problem (English)
0 references
27 September 2022
0 references
parameterized complexity
0 references
FPT
0 references
W[1]-hard
0 references
treewidth
0 references
vertex cover number
0 references
0.9296367
0 references
0.90682393
0 references
0.89680755
0 references
0.8966512
0 references
0.89184064
0 references
0.8897479
0 references
0.8861159
0 references
0.8861159
0 references
0.8858483
0 references
