Solving Target Set Selection with Bounded Thresholds Faster than 2^n (Q5009485)
From MaRDI portal
scientific article; zbMATH DE number 7378608
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving Target Set Selection with Bounded Thresholds Faster than 2^n |
scientific article; zbMATH DE number 7378608 |
Statements
4 August 2021
0 references
exact exponential algorithms
0 references
target set
0 references
vertex thresholds
0 references
social influence
0 references
irreversible conversions of graphs
0 references
bootstrap percolation
0 references
0 references
0 references
Solving Target Set Selection with Bounded Thresholds Faster than 2^n (English)
0 references
