Revisiting connected vertex cover: FPT algorithms and lossy kernels (Q2322693)
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: Revisiting connected vertex cover: FPT algorithms and lossy kernels |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Revisiting connected vertex cover: FPT algorithms and lossy kernels |
scientific article |
Statements
Revisiting connected vertex cover: FPT algorithms and lossy kernels (English)
0 references
5 September 2019
0 references
parameterized complexity
0 references
connected vertex cover
0 references
lossy kernelization
0 references
structural parameterization
0 references
W-hardness
0 references
0 references
0 references
0 references
0 references
0.8515385389328003
0 references
0.7897964119911194
0 references
0.782988965511322
0 references
0.7811042666435242
0 references
0.7761321067810059
0 references
