HEDV-Greedy: An Advanced Algorithm for Influence Maximization in Hypergraphs
Influence maximization (IM) has shown wide applicability in various fields over the past few decades, e.g., viral marketing, rumor control, and prevention of infectious diseases.Nevertheless, existing research on IM primarily focuses on ordinary networks with pairwise connections between nodes, which fall short in the representation of higher-order