How to choose friends strategically

DOI10.1016/J.TCS.2018.07.013zbMath1444.91177OpenAlexW4206524171WikidataQ129442156 ScholiaQ129442156MaRDI QIDQ5919425

Kangkang Wu, Lata Narayanan

Publication date: 13 February 2020

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2018.07.013

zbMATH Keywords

dynamic programmingNP-completenesssocial networksinfluence maximizationpolytime algorithms for trees, paths and cliques

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Social networks; opinion dynamics (91D30)

Related Items (1)

Generalizations, formulations and subgradient based heuristic with dynamic programming procedure for target set selection problems

Uses Software

• CELF++

Cites Work

• Unnamed Item
• Treewidth governs the complexity of target set selection
• An upper bound on the sum of squares of degrees in a graph
• Whom to befriend to influence people
• Influence Diffusion in Social Networks under Time Window Constraints
• On the Non-progressive Spread of Influence through Social Networks
• Submodularity of Influence in Social Networks: From Local to Global
• Optimizing Spread of Influence in Social Networks via Partial Incentives
• Latency-Bounded Target Set Selection in Social Networks
• Maximizing Social Influence in Nearly Optimal Time
• Automata, Languages and Programming

This page was built for publication: How to choose friends strategically