1 paper
Lingling Zhang, Hong Jiang, Ye Yuan +1
Given a hypergraph, influence maximization (IM) is to discover a seed set containing k vertices that have the maximal influence. Although the existing vertex-based IM algorithms…