Preprocessing subgraph and minor problems: when does a small vertex cover help? (Q386050)
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 6238127
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Preprocessing subgraph and minor problems: when does a small vertex cover help? |
scientific article; zbMATH DE number 6238127 |
Statements
Preprocessing subgraph and minor problems: when does a small vertex cover help? (English)
0 references
13 December 2013
0 references
kernelization complexity
0 references
parameterization by vertex cover
0 references
0 references
0 references
0 references
0.9799278378486632
0 references
0.8222678303718567
0 references
0.8169078826904297
0 references
0.8165761828422546
0 references
0.8164787292480469
0 references
