Parameterized reductions and algorithms for a graph editing problem that generalizes vertex cover (Q714786)
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 6093011
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized reductions and algorithms for a graph editing problem that generalizes vertex cover |
scientific article; zbMATH DE number 6093011 |
Statements
Parameterized reductions and algorithms for a graph editing problem that generalizes vertex cover (English)
0 references
11 October 2012
0 references
vertex cover
0 references
hitting set
0 references
graph editing
0 references
error correction
0 references
parameterized complexity
0 references
problem kernel
0 references
0 references
0.9678828120231628
0 references
0.8540892601013184
0 references
0.7729381322860718
0 references
0.7683066725730896
0 references
0.7635129690170288
0 references
