|
|
|
|
|
Agostinho Agra and Jose Maria Samuco
Given a social network modelled by a graph, the goal of the influence maximization problem is to find k vertices that maximize the number of active vertices through a process of diffusion. For this diffusion, the linear threshold model is considered. A n...
ver más
|
|
|
|
|
|
|
|
|
|
|
Federico Corò, Gianlorenzo D'Angelo and Cristina M. Pinotti
In this paper, we consider the problem of improving the reachability of a graph. We approach the problem from a graph augmentation perspective, in which a limited set size of edges is added to the graph to increase the overall number of reachable nodes. ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Simai He, Jiawei Zhang, and Shuzhong Zhang
Pág. 128 - 137
|
|
|
|
|
|
|
|
|
|
|
Parnas, M. Ron, D. Rubinfeld, R.
Pág. 1158 - 1184
|
|
|
|
|
|