LP can be a cure for parameterized problems (Q2904774)
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: LP can be a cure for parameterized problems |
scientific article; zbMATH DE number 6070914
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | LP can be a cure for parameterized problems |
scientific article; zbMATH DE number 6070914 |
Statements
23 August 2012
0 references
graph algorithms
0 references
parameterized algorithms
0 references
vertex cover
0 references
LP can be a cure for parameterized problems (English)
0 references
0.9613816738128662
0 references
0.8506506085395813
0 references
0.8506120443344116
0 references
0.8472855687141418
0 references
0.8195431232452393
0 references
