On the parameterized complexity of vertex cover and edge cover with connectivity constraints (Q482281)
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 6382134
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the parameterized complexity of vertex cover and edge cover with connectivity constraints |
scientific article; zbMATH DE number 6382134 |
Statements
On the parameterized complexity of vertex cover and edge cover with connectivity constraints (English)
0 references
22 December 2014
0 references
parameterized complexity
0 references
connectivity problems
0 references
kernel lower bounds
0 references
vertex cover
0 references
edge cover
0 references
0.9679420590400696
0 references
0.8326436281204224
0 references
0.8210047483444214
0 references
0.81858891248703
0 references
0.7856613993644714
0 references
