Being an influencer is hard: the complexity of influence maximization in temporal graphs with a fixed source (Q6559029)
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: Being an influencer is hard: the complexity of influence maximization in temporal graphs with a fixed source |
scientific article; zbMATH DE number 7868759
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Being an influencer is hard: the complexity of influence maximization in temporal graphs with a fixed source |
scientific article; zbMATH DE number 7868759 |
Statements
Being an influencer is hard: the complexity of influence maximization in temporal graphs with a fixed source (English)
0 references
21 June 2024
0 references
influence maximization
0 references
social networks
0 references
temporal graphs
0 references
computational complexity
0 references
Parameterized complexity
0 references
0 references
