The following pages link to Variants of spreading messages (Q5891345):
Displaying 18 items.
- Spreading messages (Q1029342) (← links)
- Discovering small target sets in social networks: a fast and effective algorithm (Q1635708) (← links)
- Active influence spreading in social networks (Q1731507) (← links)
- On the harmless set problem parameterized by treewidth (Q2154099) (← links)
- Parameterized approximability of maximizing the spread of influence in networks (Q2250539) (← links)
- Whom to befriend to influence people (Q2292915) (← links)
- Fast and frugal targeting with incentives (Q2297851) (← links)
- The complexity of finding harmless individuals in social networks (Q2339843) (← links)
- Influence diffusion in social networks under time window constraints (Q2345457) (← links)
- Spread of influence in weighted networks under time and budget constraints (Q2347001) (← links)
- Latency-bounded target set selection in social networks (Q2447759) (← links)
- Evangelism in Social Networks (Q2819494) (← links)
- Influence Diffusion in Social Networks under Time Window Constraints (Q2868640) (← links)
- Optimizing Spread of Influence in Social Networks via Partial Incentives (Q3460711) (← links)
- A Fast and Effective Heuristic for Discovering Small Target Sets in Social Networks (Q3467846) (← links)
- On Structural Parameterizations of the Harmless Set Problem (Q6492087) (← links)
- On the complexity of target set selection in simple geometric networks (Q6606994) (← links)
- Graph burning in community-based networks (Q6636996) (← links)
