Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Ribaga, Eros"'
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. Among the various methods for solving the IM problem, evolutionary a
Externí odkaz:
http://arxiv.org/abs/2405.10187
