Search Results - "Rescigno, Adele Anna"
-
1
Evangelism in social networks: Algorithms and complexity
Published in Networks (01-06-2018)“…We consider a population of interconnected individuals that, with respect to a piece of information, at each time instant can be subdivided into three…”
Get full text
Journal Article -
2
Parameterized Complexity of Immunization in the Threshold Model
Published 06-02-2021“…We consider the problem of controlling the spread of harmful items in networks, such as the contagion proliferation of diseases or the diffusion of fake news…”
Get full text
Journal Article -
3
Iterated Type Partitions
Published 22-01-2020“…This paper deals with the complexity of some natural graph problems when parametrized by {measures that are restrictions of} clique-width, such as…”
Get full text
Journal Article -
4
Influence propagation over large scale social networks
Published in 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) (25-08-2015)“…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…”
Get full text
Conference Proceeding -
5
On Finding Small Sets that Influence Large Networks
Published 16-10-2016“…Soc. Netw. Anal. Min. (2016) 6:94 We consider the problem of selecting a minimum size subset of nodes in a network, that allows to activate all the nodes of…”
Get full text
Journal Article -
6
Evangelism in Social Networks: Algorithms and Complexity
Published 29-10-2016“…We consider a population of interconnected individuals that, with respect to a piece of information, at each time instant can be subdivided into three…”
Get full text
Journal Article -
7
Time-Bounded Influence Diffusion with Incentives
Published 18-07-2018“…A widely studied model of influence diffusion in social networks represents the network as a graph $G=(V,E)$ with an influence threshold $t(v)$ for each node…”
Get full text
Journal Article -
8
Multicasting to groups in optical networks and related combinatorial optimization problems
Published in Proceedings International Parallel and Distributed Processing Symposium (2003)“…Given a source node and a family D of subsets of nodes of a WDM optical network, the multicasting to groups (MG) problem is to find a set of paths from the…”
Get full text
Conference Proceeding