Enumerate and expand: Improved algorithms for connected vertex cover and tree cover (Q929296)
From MaRDI portal
!
WARNING
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 5288695
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Enumerate and expand: Improved algorithms for connected vertex cover and tree cover |
scientific article; zbMATH DE number 5288695 |
Statements
Enumerate and expand: Improved algorithms for connected vertex cover and tree cover (English)
0 references
17 June 2008
0 references
Exact algorithms
0 references
Parameterized complexity
0 references
Enumerate and expand
0 references
Vertex cover
0 references
0.995229721069336
0 references
0.882537305355072
0 references
0.8152273893356323
0 references
0.8005728125572205
0 references
