Abstract
With the ongoing growth of social networks, individuals are obtaining a platform from which they can spread their opinions and ideas without restrictions and without noticing we are allowing those opinions to influence our sociological, political, and personal opinions. It is now much easier to broadcast an idea that has a potential to widely spread positive or negative influence across a social network. In an attempt to address influence in this context, the notion of a 'positive influence dominating set' appeared recently: a positive influence dominating set in a graph, or network, is a set of nodes D such that every other node has a sufficient percentage of neighbors in D. The corresponding optimization problem seeks a positive influence dominating set of minimum size. In this paper we present and study efficient heuristic algorithms for the problem and show how different types of social networks/graphs require different heuristic methods to effectively extract positive influence dominating sets.
Original language | English |
---|---|
Title of host publication | INFOCOM 2018 - IEEE Conference on Computer Communications Workshops |
Publisher | IEEE, Institute of Electrical and Electronics Engineers |
Pages | 610-615 |
Number of pages | 6 |
ISBN (Electronic) | 9781538659793 |
DOIs | |
Publication status | Published - 6 Jul 2018 |
Event | 2018 IEEE Conference on Computer Communications Workshops, INFOCOM 2018 - Honolulu, United States Duration: 15 Apr 2018 → 19 Apr 2018 |
Conference
Conference | 2018 IEEE Conference on Computer Communications Workshops, INFOCOM 2018 |
---|---|
Country/Territory | United States |
City | Honolulu |
Period | 15/04/18 → 19/04/18 |