Tight complexity bounds for counting generalized dominating sets in bounded-treewidth graphs. II: Hardness results (Q6949658)
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 8073219
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tight complexity bounds for counting generalized dominating sets in bounded-treewidth graphs. II: Hardness results |
scientific article; zbMATH DE number 8073219 |
Statements
Tight complexity bounds for counting generalized dominating sets in bounded-treewidth graphs. II: Hardness results (English)
0 references
1 August 2025
0 references
dominating set
0 references
independent set
0 references
parameterized algorithms
0 references
0 references
0 references
0 references
0 references
