No Thumbnail Available
Files
Collignon_78261000_Montoisy_59111000_2017.pdf
Closed access - Adobe PDF
- 1.07 MB
Details
- Supervisors
- Faculty
- Degree label
- Abstract
- The present master thesis firstly describes the spread maximization problem and its computational complexity. Due to this hardness, the best seed of nodes cannot be found directly, especially for huge networks. Hence, heuristics have to be created and used. The goal of our thesis is to compare performances (in terms of effectiveness and efficiency) of different heuristics on finding the best seed set of nodes in order to maximize the final influence spread on social networks. Based on our findings, further applications are discussed at the end of this paper.