Minimizing the expected complete influence time of a social network
From MaRDI portal
Publication:985076
DOI10.1016/J.INS.2010.03.012zbMATH Open1194.91164OpenAlexW1997561104MaRDI QIDQ985076FDOQ985076
Authors: Yaodong Ni, Lei Xie, Zhiqiang Liu 
Publication date: 20 July 2010
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2010.03.012
Recommendations
- On the approximability of influence in social networks
- Influence maximization with latency requirements on social networks
- Maximizing social influence in nearly optimal time
- Influence diffusion in social networks under time window constraints
- Influence Diffusion in Social Networks under Time Window Constraints
- Least cost influence propagation in (social) networks
- Least-cost influence maximization on social networks
Cites Work
- Statistical mechanics of complex networks
- Introduction to algorithms
- Emergence of Scaling in Random Networks
- Title not available (Why is that?)
- On the spread of viruses on the Internet
- Collective dynamics of ‘small-world’ networks
- A faster algorithm for betweenness centrality*
- Automata, Languages and Programming
- Title not available (Why is that?)
- Ergodic theorems for weakly interacting infinite systems and the voter model
- Title not available (Why is that?)
- Title not available (Why is that?)
- A model for spatial conflict
- Title not available (Why is that?)
- Contagion
- Properties of on-line social systems
Cited In (4)
This page was built for publication: Minimizing the expected complete influence time of a social network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q985076)
