Solving target set selection with bounded thresholds faster than \(2^n\) (Q2684482)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving target set selection with bounded thresholds faster than \(2^n\) |
scientific article |
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
