An \(O^\ast ( 2 . 61 9^k )\) algorithm for \textsc{4-path vertex cover} (Q2659056): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.dam.2020.11.019 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DAM.2020.11.019 / rank | |||
Normal rank | |||
Latest revision as of 14:15, 19 December 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
0 references
