On the parameterized vertex cover problem for graphs with perfect matching (Q893740)
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: On the parameterized vertex cover problem for graphs with perfect matching |
scientific article; zbMATH DE number 6512376
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the parameterized vertex cover problem for graphs with perfect matching |
scientific article; zbMATH DE number 6512376 |
Statements
On the parameterized vertex cover problem for graphs with perfect matching (English)
0 references
20 November 2015
0 references
NP-complete
0 references
parameterized algorithm
0 references
vertex cover
0 references
iterative compression
0 references
0 references
0 references
0.879976749420166
0 references
0.858400285243988
0 references
0.8277145028114319
0 references
0.8130298852920532
0 references
