Pages that link to "Item:Q1635708"
From MaRDI portal
The following pages link to Discovering small target sets in social networks: a fast and effective algorithm (Q1635708):
Displaying 14 items.
- The complexity of finding effectors (Q519899) (← links)
- On the complexity of reasoning about opinion diffusion under majority dynamics (Q785234) (← links)
- Optimal majority dynamics for the diffusion of an opinion when multiple alternatives are available (Q831148) (← links)
- Active influence spreading in social networks (Q1731507) (← links)
- Deprecation based greedy strategy for target set selection in large scale social networks (Q1749822) (← links)
- Optimizing node discovery on networks: problem definitions, fast algorithms, and observations (Q2201666) (← links)
- Fast and frugal targeting with incentives (Q2297851) (← links)
- Bounds and extremal graphs for degenerate subsets, dynamic monopolies, and partial incentives (Q2421880) (← links)
- Latency-bounded target set selection in social networks (Q2447759) (← links)
- A global optimization algorithm for target set selection problems (Q2629957) (← links)
- Generalizations, formulations and subgradient based heuristic with dynamic programming procedure for target set selection problems (Q2669540) (← links)
- Immunization in the threshold model: a parameterized complexity study (Q6069928) (← links)
- Target set selection with maximum activation time (Q6110610) (← links)
- Graph burning in community-based networks (Q6636996) (← links)
