An \(O^\ast ( 2 . 61 9^k )\) algorithm for \textsc{4-path vertex cover} (Q2659056): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:48, 3 February 2024
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
