Exact solutions for latency-bounded target set selection problem on some special families of graphs (Q260041)
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: Exact solutions for latency-bounded target set selection problem on some special families of graphs |
scientific article; zbMATH DE number 6558413
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exact solutions for latency-bounded target set selection problem on some special families of graphs |
scientific article; zbMATH DE number 6558413 |
Statements
Exact solutions for latency-bounded target set selection problem on some special families of graphs (English)
0 references
18 March 2016
0 references
social networks
0 references
viral marketing
0 references
target set selection
0 references
majority threshold
0 references
0.9286786317825316
0 references
0.8262216448783875
0 references
0.8255565762519836
0 references
0.7949840426445007
0 references
0.790279746055603
0 references
