On approximate preprocessing for domination and hitting subgraphs with connected deletion sets (Q2316936)
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 7089550
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On approximate preprocessing for domination and hitting subgraphs with connected deletion sets |
scientific article; zbMATH DE number 7089550 |
Statements
On approximate preprocessing for domination and hitting subgraphs with connected deletion sets (English)
0 references
7 August 2019
0 references
parameterized complexity
0 references
kernelization
0 references
vertex deletion problems
0 references
0 references
0 references
0 references
0.9194188117980956
0 references
0.7890174984931946
0 references
0.7859851717948914
0 references
0.7800959348678589
0 references
0.7714883089065552
0 references
