A New Algorithm Framework for the Influence Maximization Problem Using Graph Clustering

A New Algorithm Framework for the Influence Maximization Problem Using Graph Clustering

Given a social network modelled by a graph, the goal of the influence maximization problem is to find <i>k</i> vertices that maximize the number of active vertices through a process of diffusion. For this diffusion, the linear threshold model is considered. A new algorithm, called Cluste...

Full description

Bibliographic Details
Main Authors: Agostinho Agra, Jose Maria Samuco
Format: Article
Language:English
Published: MDPI AG 2024-02-01
Series:Information
Subjects:
cluster
influence maximization
greedy algorithm
linking set
linear threshold model
Online Access:https://www.mdpi.com/2078-2489/15/2/112

Similar Items

Similar Items