Kernelization for counting problems on graphs: preserving the number of minimum solutions (Q6926182)
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 8097206
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Kernelization for counting problems on graphs: preserving the number of minimum solutions |
scientific article; zbMATH DE number 8097206 |
Statements
Kernelization for counting problems on graphs: preserving the number of minimum solutions (English)
0 references
24 September 2025
0 references
kernelization
0 references
counting problems
0 references
feedback vertex set
0 references
dominating set
0 references
protrusion decomposition
0 references
