An efficient adaptive degree-based heuristic algorithm for influence maximization in hypergraphs

An efficient adaptive degree-based heuristic algorithm for influence maximization in hypergraphs | Litlas