1 paper
Stefano Genetti, Eros Ribaga, Elia Cunegatti +2
The Influence Maximization (IM) problem is a well-known NP-hard combinatorial problem over graphs whose goal is to find the set of nodes in a network that spreads influence at most…