Given a social network with diffusion probabilities as edge weights and a positive integer k,
which k nodes should be chosen for initial injection of information to maximize the influence …

Motivated by applications in sociology, economy and medicine, we study variants of the
Target Set Selection problem, first proposed by Kempe, Kleinberg and Tardos. In our …

We consider the following activation process in undirected graphs: a vertex is active either if
it belongs to a set of initially activated vertices or if at some point it has at least r active …

A survey on alliances and related parameters in graphs Page 1 www.ejgta.org Electronic
Journal of Graph Theory and Applications 2 (1) (2014), 70–86 A survey on alliances and related …

In this paper, we consider the problem of maximizing the spread of influence through a
social network. Given a graph with a threshold value thr (v) attached to each vertex v, the …

Given a network represented by a weighted directed graph G, we consider the problem of
finding a bounded cost set of nodes S such that the influence spreading from S in G, within a …

A widely studied process of influence diffusion in social networks posits that the dynamics of
influence diffusion evolves as follows: Given a graph G=(V, E), representing the network …

We study the influence diffusion problem in online social networks. Formally, given a
network represented by a directed graph G=(V, E), we consider a process of influence …

This paper studies new complexity aspects of P 3-convexity restricted to planar graphs with
bounded maximum degree. More specifically, we are interested in identifying either a …

We study a combinatorial model of the spread of influence in networks that generalizes
existing schemata recently proposed in the literature. In our model, agents change …