The following pages link to (Q3579502):
Displaying 17 items.
- On Bharathi-Kempe-Salek conjecture for influence maximization on arborescence (Q281819) (← links)
- On non-progressive spread of influence through social networks (Q401306) (← links)
- Combinatorial model and bounds for target set selection (Q410735) (← links)
- Treewidth governs the complexity of target set selection (Q456700) (← links)
- On the computational complexity of measuring global stability of banking networks (Q487019) (← links)
- Solution of Bharathi-Kempe-Salek conjecture for influence maximization on arborescence (Q511732) (← links)
- Improved approximation algorithms for label cover problems (Q634686) (← links)
- On the complexity of reasoning about opinion diffusion under majority dynamics (Q785234) (← links)
- Minimizing the expected complete influence time of a social network (Q985076) (← links)
- On the approximability of the minimum rainbow subgraph problem and other related problems (Q1679237) (← links)
- Triggering cascades on undirected connected graphs (Q1944178) (← links)
- The firefighter problem with more than one firefighter on trees (Q1949095) (← links)
- Whom to befriend to influence people (Q2292915) (← links)
- Minimal contagious sets in random regular graphs (Q2350108) (← links)
- Competitive and collaborative influence in social networks (Q2422617) (← links)
- The Routing of Complex Contagion in Kleinberg’s Small-World Networks (Q2817872) (← links)
- New Results on the Complexity of the Max- and Min-Rep Problems (Q3075522) (← links)
