Faster algorithms and a smaller kernel for \textsc{Cliques or Trees Vertex Deletion} (Q6970529)
From MaRDI portal
!
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 8053768
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Faster algorithms and a smaller kernel for \textsc{Cliques or Trees Vertex Deletion} |
scientific article; zbMATH DE number 8053768 |
Statements
Faster algorithms and a smaller kernel for \textsc{Cliques or Trees Vertex Deletion} (English)
0 references
17 June 2025
0 references
graph algorithms
0 references
parameterized complexity
0 references
branching algorithms
0 references
kernelization
0 references
0 references
