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, whi...
Main Authors: | Haosen Wang, Qingtao Pan, Jun Tang |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2024-03-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/12/7/1041 |
Similar Items
-
Social Influence Maximization in Hypergraphs
by: Alessia Antelmi, et al.
Published: (2021-06-01) -
On the Sizes of (k, l)-Edge-Maximal r-Uniform Hypergraphs
by: Tian Yingzhi, et al.
Published: (2023-02-01) -
Subdivision of hypergraphs and their colorings
by: Moharram N. Iradmusa
Published: (2020-03-01) -
An Influence maximization algorithm in social network using K-shell decomposition and community detection
by: Alighanbari, et al.
Published: (2020-03-01) -
Ideal based hypergraph of a commutative ring
by: V. C. Amritha, et al.
Published: (2021-11-01)