Almost exact minimum feedback vertex set in meshes and butterflies
Information Processing Letters
Size bounds for dynamic monopolies
Discrete Applied Mathematics
Euro-Par '98 Proceedings of the 4th International Euro-Par Conference on Parallel Processing
A generalization of the firefighter problem on z × z
Discrete Applied Mathematics
Approximation Algorithms for the Firefighter Problem: Cuts over Time and Submodularity
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Finding critical nodes for inhibiting diffusion of complex contagions in social networks
ECML PKDD'10 Proceedings of the 2010 European conference on Machine learning and knowledge discovery in databases: Part II
Brief announcement: on reversible and irreversible conversions
DISC'10 Proceedings of the 24th international conference on Distributed computing
Irreversible conversion of graphs
Theoretical Computer Science
The south zone: distributed algorithms for alliances
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Dynamic monopolies and feedback vertex sets in hexagonal grids
Computers & Mathematics with Applications
Stable sets of threshold-based cascades on the erdős-rényi random graphs
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Discrete Applied Mathematics
On the radon number for p3 convexity
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Triggering cascades on undirected connected graphs
Information Processing Letters
The robust set problem: parameterized complexity and approximation
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Reversible iterative graph processes
Theoretical Computer Science
Bounding the sizes of dynamic monopolies and convergent sets for threshold-based cascades
Theoretical Computer Science
Immediate versus eventual conversion: comparing geodetic and hull numbers in P3-convexity
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Interaction-based HPC modeling of social, biological, and economic contagions over large networks
Proceedings of the Winter Simulation Conference
Constant thresholds can make target set selection tractable
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
The firefighter problem with more than one firefighter on trees
Discrete Applied Mathematics
Large Social Networks Can Be Targeted for Viral Marketing with Small Seed Sets
ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)
Using Generalized Annotated Programs to Solve Social Network Diffusion Optimization Problems
ACM Transactions on Computational Logic (TOCL)
Generalized degeneracy, dynamic monopolies and maximum degenerate subgraphs
Discrete Applied Mathematics
| Hi-index | 0.05 |
We will consider models of the spread of disease or opinion through social networks, represented as graphs. In our models, vertices will be in one of two states, 1 (''infected'') or 0 (''uninfected'') and change of state will take place at discrete times. After describing several such models, we will concentrate on the model, called an irreversible k-threshold process, where a vertex enters state 1 if at least k of its neighbors are in state 1, and where a vertex never leaves state 1 once it is in it. We will seek sets of vertices with the property that, if they are in state 1 at the beginning, then eventually all vertices end up in state 1. Such vertex sets correspond to vertices that can be infected with a disease or opinion so as to guarantee saturation of the population with the disease or opinion. We will also discuss ways to ''defend'' against such saturating sets, for example by ''vaccination'' or designing network topologies.