Treewidth governs the complexity of target set selection (Q456700)
From MaRDI portal
!
WARNING
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 6094035
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Treewidth governs the complexity of target set selection |
scientific article; zbMATH DE number 6094035 |
Statements
Treewidth governs the complexity of target set selection (English)
0 references
16 October 2012
0 references
target set selection
0 references
bounded tree-width algorithm
0 references
bounded tree-width lower-bound
0 references
viral marketing
0 references
social networks
0 references
game of life
0 references
0 references
0.8776750564575195
0 references
0.8729473352432251
0 references
0.869018018245697
0 references
0.8653590679168701
0 references
0.8632288575172424
0 references
