1 paper
Xiaobin Rui, Zhixiao Wang, Jiayu Zhao +2
Given a graph G, a community structure C, and a budget k, the fair influence maximization problem aims to select a seed set S (∣S∣≤k) that maximizes the inf…