An \(O^\ast ( 2 . 61 9^k )\) algorithm for \textsc{4-path vertex cover} (Q2659056)
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: An \(O^\ast ( 2 . 61 9^k )\) algorithm for \textsc{4-path vertex cover} |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(O^\ast ( 2 . 61 9^k )\) algorithm for \textsc{4-path vertex cover} |
scientific article |
Statements
An \(O^\ast ( 2 . 61 9^k )\) algorithm for \textsc{4-path vertex cover} (English)
0 references
25 March 2021
0 references
graph algorithms
0 references
parameterized complexity
0 references
iterative compression
0 references
branching rules
0 references
0 references
