1 paper
Soheil Shahrouz, Saber Salehkaleybar, Matin Hashemi
Given a social network modeled as a weighted graph G, the influence maximization problem seeks k vertices to become initially influenced, to maximize the expected number of inf…