The complexity of finding effectors
DOI10.1007/s00224-016-9670-8zbMath1362.68102arXiv1411.7838WikidataQ62039059 ScholiaQ62039059MaRDI QIDQ519899
Rolf Niedermeier, Vincent Froese, Laurent Bulteau, Stefan Fafianie, Nimrod Talmon
Publication date: 31 March 2017
Published in: Lecture Notes in Computer Science, Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1411.7838
social networks; parameterized complexity; exact algorithms; influence maximization; network activation; probabilistic information propagation
68Q25: Analysis of algorithms and problem complexity
91D30: Social networks; opinion dynamics
68R10: Graph theory (including graph drawing) in computer science
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68Q87: Probability in computer science (algorithm analysis, random structures, phase transitions, etc.)
