Pages that link to "Item:Q3060749"
From MaRDI portal
The following pages link to On Tractable Cases of Target Set Selection (Q3060749):
Displaying 22 items.
- The complexity of finding effectors (Q519899) (← links)
- Optimal majority dynamics for the diffusion of an opinion when multiple alternatives are available (Q831148) (← links)
- Discovering small target sets in social networks: a fast and effective algorithm (Q1635708) (← links)
- Active influence spreading in social networks (Q1731507) (← links)
- Some results on the target set selection problem (Q1956258) (← links)
- On reconfigurability of target sets (Q2110378) (← links)
- Parameterized approximability of maximizing the spread of influence in networks (Q2250539) (← links)
- Constant thresholds can make target set selection tractable (Q2254488) (← links)
- Whom to befriend to influence people (Q2292915) (← links)
- Dynamic monopolies in directed graphs: the spread of unilateral influence in social networks (Q2449109) (← links)
- Evangelism in Social Networks (Q2819494) (← links)
- On irreversible spread of influence in edge-weighted graphs (Q3303530) (← links)
- A Fast and Effective Heuristic for Discovering Small Target Sets in Social Networks (Q3467846) (← links)
- Target Set Selection in Dense Graph Classes (Q5062113) (← links)
- (Q5091008) (← links)
- An Adaptive Version of Brandes' Algorithm for Betweenness Centrality (Q5091028) (← links)
- Grundy Distinguishes Treewidth from Pathwidth (Q5096586) (← links)
- An Adaptive Version of Brandes' Algorithm for Betweenness Centrality (Q5131226) (← links)
- Enhancing Target Group Selection Using Belief Functions (Q5392085) (← links)
- (Q5874480) (← links)
- Weighted target set selection on trees and cycles (Q6087138) (← links)
- Target set selection with maximum activation time (Q6110610) (← links)
