103 citations · 167 across the 19 of their papers we have counts for
Showing cs.SIShow all
2 papers · 1 filter
cs.SI2024
Influence Maximization in Hypergraphs by Stratified Sampling for Efficient Generation of Reverse Reachable Sets
Lingling Zhang, Hong Jiang, Ye Yuan +1
Given a hypergraph, influence maximization (IM) is to discover a seed set containing vertices that have the maximal influence. Although the existing vertex-based IM algorithms…
cs.SI2019★ 3 cited
Mining Bursting Communities in Temporal Graphs
Hongchao Qin, Rong-Hua Li, Guoren Wang +3
Temporal graphs are ubiquitous. Mining communities that are bursting in a period of time is essential to seek emergency events in temporal graphs. Unfortunately, most previous stud…