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

DOI10.1016/J.IC.2024.105171MaRDI QIDQ6559029

Tiger-Lily Goldsmith, Eduard Eiben, Michelle Döring, Argyrios Deligkas, George Skretas

Publication date: 21 June 2024

Published in: Information and Computation (Search for Journal in Brave)

zbMATH Keywords

computational complexitysocial networksinfluence maximizationParameterized complexitytemporal graphs

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Title not available (Why is that?)
• Fundamentals of parameterized complexity
• A note on competitive diffusion through social networks
• Competitive facility location: the Voronoi game
• Two-Player Competitive Diffusion Game: Graph Classes and the Existence of a Nash Equilibrium
• Nash Equilibria in Voronoi Games on Graphs
• Fixed-Parameter Tractability and Completeness I: Basic Results
• Parameterized Algorithms
• Connectivity and inference problems for temporal networks

Related Items (1)

On the complexity of target set selection in simple geometric networks

This page was built for publication: Being an influencer is hard: the complexity of influence maximization in temporal graphs with a fixed source

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6559029)