On approximate preprocessing for domination and hitting subgraphs with connected deletion sets (Q2316936)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On approximate preprocessing for domination and hitting subgraphs with connected deletion sets |
scientific article |
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
