Computational aspects of optimal strategic network diffusion

DOI10.1016/J.TCS.2020.01.027zbMath1435.68245arXiv1809.03141OpenAlexW2890619743MaRDI QIDQ2304561

Cesar Hidalgo, Aamena Alshamsi, Marcin Waniek, Flávio L. Pinheiro, Khaled M. Elbassioni

Publication date: 12 March 2020

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1809.03141

zbMATH Keywords

complex networksinfluence maximizationnetwork contagionstrategic diffusion

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Parameterized complexity, tractability and kernelization (68Q27)

Cites Work

• Graph minors. III. Planar tree-width
• Reducibility among Combinatorial Problems
• Analytical approach to parallel repetition
• The theory of dynamic programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computational aspects of optimal strategic network diffusion