Pages that link to "Item:Q1928515"
From MaRDI portal
The following pages link to The complexity of influence maximization problem in the deterministic linear threshold model (Q1928515):
Displaying 11 items.
- On Bharathi-Kempe-Salek conjecture for influence maximization on arborescence (Q281819) (← links)
- Solution of Bharathi-Kempe-Salek conjecture for influence maximization on arborescence (Q511732) (← links)
- The complexity of finding effectors (Q519899) (← links)
- On the shoulders of giants: incremental influence maximization in evolving social networks (Q1688079) (← links)
- Algorithms for influence maximization in socio-physical networks (Q2095554) (← links)
- Dynamic model of information diffusion based on multidimensional complex network space and social game (Q2157190) (← links)
- Parameterized approximability of maximizing the spread of influence in networks (Q2250539) (← links)
- The fashion game: network extension of matching pennies (Q2453175) (← links)
- Optimizing spread dynamics on graphs by message passing (Q3301689) (← links)
- Beyond Worst-case (In)approximability of Nonsubmodular Influence Maximization (Q5205807) (← links)
- An exact method for influence maximization based on deterministic linear threshold model (Q6100686) (← links)