Spread of influence in weighted networks under time and budget constraints ✩
It is proved that the problem of defining a bounded cost set of nodes S such that the influence spreading from S in G, within a given time bound, is as large as possible, and that the problem is NP-hard, even in simple networks like complete graphs and trees.
F. Cicalese, G. Cordasco, L. Gargano et al.
· 0 citations