The following pages link to (Q2941641):
Displayed 50 items.
- Complexity of equilibrium in competitive diffusion games on social networks (Q273917) (← links)
- Parallelization of game theoretic centrality algorithms (Q301779) (← links)
- Sequential decision aggregation with social pressure (Q329108) (← links)
- Social structure optimization in team formation (Q342472) (← links)
- A tight upper bound on acquaintance time of graphs (Q343701) (← links)
- A note on the acquaintance time of random graphs (Q396895) (← links)
- Staying safe and visible via message sharing in online social networks (Q405681) (← links)
- On dynamic monopolies of graphs with general thresholds (Q409449) (← links)
- Combinatorial model and bounds for target set selection (Q410735) (← links)
- New bounds for contagious sets (Q418891) (← links)
- Modeling the spread of fault in majority-based network systems: dynamic monopolies in triangular grids (Q427907) (← links)
- Polynomial time approximation scheme for \(t\)-latency bounded information propagation problem in wireless networks (Q437049) (← links)
- On dynamic monopolies of graphs: the average and strict majority thresholds (Q448965) (← links)
- Treewidth governs the complexity of target set selection (Q456700) (← links)
- Data mining of social networks represented as graphs (Q465703) (← links)
- A nature-inspired influence propagation model for the community expansion problem (Q489686) (← links)
- An individual-based model of information diffusion combining friends' influence (Q489688) (← links)
- Potential induced random teleportation on finite graphs (Q493692) (← links)
- Assignment games with conflicts: robust price of anarchy and convergence results via semi-smoothness (Q503458) (← links)
- Marketing impact on diffusion in social networks (Q504513) (← links)
- Measuring the impact of MVC attack in large complex networks (Q506775) (← links)
- Approximation algorithms for pricing with negative network externalities (Q511718) (← links)
- The complexity of finding effectors (Q519899) (← links)
- Irreversible conversion of graphs (Q551200) (← links)
- Competitivity groups on social network sites (Q622978) (← links)
- On dissemination thresholds in regular and irregular graph classes (Q627518) (← links)
- Informational influence and informational control models in social networks (Q650017) (← links)
- Reversible iterative graph processes (Q690472) (← links)
- Ranking by inspiration: a network science approach (Q782470) (← links)
- On the complexity of reasoning about opinion diffusion under majority dynamics (Q785234) (← links)
- Social network discovery by mining spatio-temporal events (Q812009) (← links)
- A parameterized complexity view on collapsing \(k\)-cores (Q825978) (← links)
- Streaming algorithms for robust submodular maximization (Q827610) (← links)
- Bounded confidence dynamics and graph control: enforcing consensus (Q828470) (← links)
- Influence maximization problem: properties and algorithms (Q830929) (← links)
- Burning grids and intervals (Q831694) (← links)
- Galaxy cutsets in graphs (Q975761) (← links)
- Minimizing the expected complete influence time of a social network (Q985076) (← links)
- A note on competitive diffusion through social networks (Q991758) (← links)
- Influence maximization in social networks under an independent cascade-based model (Q1619016) (← links)
- Discovering small target sets in social networks: a fast and effective algorithm (Q1635708) (← links)
- Identifying and tracking topic-level influencers in the microblog streams (Q1640397) (← links)
- Least cost influence propagation in (social) networks (Q1650779) (← links)
- A game-theoretic approach for modeling competitive diffusion over social networks (Q1651874) (← links)
- Contagious sets in dense graphs (Q1678088) (← links)
- Welfare maximization with friends-of-friends network externalities (Q1693985) (← links)
- On general threshold and general cascade models of social influence (Q1698071) (← links)
- Retracted article: ``A distance vector similarity metric for complex networks'' (Q1700992) (← links)
- Efficient influence maximization under TSCM: a suitable diffusion model in online social networks (Q1701602) (← links)
- Inhibiting diffusion of complex contagions in social networks: theoretical and experimental results (Q1711228) (← links)