Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover (Q897878)
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: Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover |
scientific article |
Statements
Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover (English)
0 references
8 December 2015
0 references
branch-and-reduce
0 references
vertex cover
0 references
exact exponential algorithms
0 references
FPT algorithms
0 references
0 references
0 references
0.9999754428863524
0 references
0.7764719724655151
0 references
0.7711817026138306
0 references
0.7588517069816589
0 references
0.7503433227539062
0 references
