scientific article; zbMATH DE number 5764908
From MaRDI portal
Publication:3579502
Cited in
(19)- On the approximability of the minimum rainbow subgraph problem and other related problems
- Triggering cascades on undirected connected graphs
- The firefighter problem with more than one firefighter on trees
- Minimal contagious sets in random regular graphs
- Competitive and collaborative influence in social networks
- The Routing of Complex Contagion in Kleinberg’s Small-World Networks
- On Bharathi-Kempe-Salek conjecture for influence maximization on arborescence
- New results on the complexity of the Max- and Min-Rep problems
- Adaptive rumor spreading
- On non-progressive spread of influence through social networks
- Combinatorial model and bounds for target set selection
- Treewidth governs the complexity of target set selection
- On the computational complexity of measuring global stability of banking networks
- Hardness Results for Seeding Complex Contagion with Neighborhoods
- Solution of Bharathi-Kempe-Salek conjecture for influence maximization on arborescence
- How to choose friends strategically
- Improved approximation algorithms for label cover problems
- On the complexity of reasoning about opinion diffusion under majority dynamics
- Minimizing the expected complete influence time of a social network
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3579502)
