On approximate preprocessing for domination and hitting subgraphs with connected deletion sets (Q2316936): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.jcss.2019.05.001 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2947622378 / rank | |||
Normal rank | |||
Revision as of 22:40, 19 March 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
