On approximate preprocessing for domination and hitting subgraphs with connected deletion sets (Q2316936): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:23, 2 February 2024
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
