Solving target set selection with bounded thresholds faster than \(2^n\) (Q2684482)
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 7654490
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving target set selection with bounded thresholds faster than \(2^n\) |
scientific article; zbMATH DE number 7654490 |
Statements
Solving target set selection with bounded thresholds faster than \(2^n\) (English)
0 references
16 February 2023
0 references
target set selection
0 references
exact exponential algorithms
0 references
vertex thresholds
0 references
social influence
0 references
irreversible conversions of graphs
0 references
bootstrap percolation
0 references
0 references
0 references
0.9965603947639464
0 references
0.8964546918869019
0 references
0.8864134550094604
0 references
0.8860289454460144
0 references
0.884284496307373
0 references
