6 citations · 11 across the 11 of their papers we have counts for
Showing cs.SIShow all
2 papers · 1 filter
cs.SI2024
Influence Maximization in Hypergraphs using Multi-Objective Evolutionary Algorithms
Stefano Genetti, Eros Ribaga, Elia Cunegatti +2
The Influence Maximization (IM) problem is a well-known NP-hard combinatorial problem over graphs whose goal is to find the set of nodes in a network that spreads influence at most…
cs.SI2022★ 4 cited
Large-scale multi-objective influence maximisation with network downscaling
Elia Cunegatti, Giovanni Iacca, Doina Bucur
Finding the most influential nodes in a network is a computationally hard problem with several possible applications in various kinds of network-based problems. While several metho…