Login / Signup

Being an influencer is hard: The complexity of influence maximization in temporal graphs with a fixed source.

Argyrios DeligkasMichelle DöringEduard EibenTiger-Lily GoldsmithGeorge Skretas
Published in: Inf. Comput. (2024)
Keyphrases
  • influence maximization
  • greedy algorithm
  • social networks
  • viral marketing
  • worst case
  • diffusion model
  • information propagation
  • website
  • computational complexity
  • graph theory
  • multiscale