most citedBeing an Influencer is Hard: The Complexity of Influence Maximization in Temporal Graphs with a Fixed Source

1 citations · 1 across the 1 of their papers we have counts for

collaborators

1 paper

cs.CC2023★ 1 cited

Being an Influencer is Hard: The Complexity of Influence Maximization in Temporal Graphs with a Fixed Source

Argyrios Deligkas, Michelle Döring, Eduard Eiben +2

We consider the influence maximization problem over a temporal graph, where there is a single fixed source. We deviate from the standard model of influence maximization, where the…