How to choose friends strategically

DOI10.1007/978-3-319-72050-0_17zbMath1446.91052OpenAlexW2776149060MaRDI QIDQ5916004

Lata Narayanan, Kangkang Wu

Publication date: 12 April 2018

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-72050-0_17

zbMATH Keywords

dynamic programmingsocial networksNP-completeinfluence 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 (2)

Whom to befriend to influence people ⋮ Fast and frugal targeting with incentives

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