Tight complexity bounds for counting generalized dominating sets in bounded-treewidth graphs (Q6538673)
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 7848100
| 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 |
scientific article; zbMATH DE number 7848100 |
Statements
Tight complexity bounds for counting generalized dominating sets in bounded-treewidth graphs (English)
0 references
14 May 2024
0 references
