The complexity of finding harmless individuals in social networks (Q2339843)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The complexity of finding harmless individuals in social networks |
scientific article; zbMATH DE number 6423629
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of finding harmless individuals in social networks |
scientific article; zbMATH DE number 6423629 |
Statements
The complexity of finding harmless individuals in social networks (English)
0 references
9 April 2015
0 references
approximation
0 references
parameterized complexity
0 references
harmless set
0 references
treewidth
0 references
social networks
0 references
0 references
0 references
0.7544196248054504
0 references
0.7247504591941833
0 references
0.7166438102722168
0 references
0.7128797173500061
0 references
0.7113885879516602
0 references
