Matching influence maximization in social networks

DOI10.1016/j.tcs.2020.12.040zbMath1480.91174OpenAlexW3117393133MaRDI QIDQ2220781

Guoyao Rao, Weili Wu, Wenping Chen, Deying Li, Yongcai Wang

Publication date: 25 January 2021

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

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

zbMATH Keywords

influence maximizationonline matchingoffline matching

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30)

Related Items (3)

Social network analysis and applications: A review of the broad research aspects of social network structure ⋮ Online conflict resolution: algorithm design and analysis ⋮ Maximizing the influence with \(\kappa\)-grouping constraint

Uses Software

• CELF++

Cites Work

• Matched participants maximization based on social spread
• Group Buying: A New Mechanism for Selling Through Social Interactions
• An analysis of approximations for maximizing submodular set functions—I
• Maximizing Social Influence in Nearly Optimal Time
• Unnamed Item

This page was built for publication: Matching influence maximization in social networks