Spreading messages
From MaRDI portal
Publication:1029342
DOI10.1016/j.tcs.2009.03.032zbMath1172.68003OpenAlexW2913116953MaRDI QIDQ1029342
Ching-Lueh Chang, Yuh-Dauh Lyuu
Publication date: 10 July 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.03.032
Related Items
ON DYNAMIC MONOPOLIES OF GRAPHS WITH PROBABILISTIC THRESHOLDS, On non-progressive spread of influence through social networks, On dynamic monopolies of graphs with general thresholds, Combinatorial model and bounds for target set selection, Triggering cascades on undirected connected graphs, On reversible cascades in scale-free and Erdős-Rényi random graphs, Spreading of messages in random graphs, On dynamic monopolies of graphs: the average and strict majority thresholds, Dynamic monopolies with randomized starting configuration, Dynamic monopolies in directed graphs: the spread of unilateral influence in social networks, Parameterized approximability of maximizing the spread of influence in networks, Constant thresholds can make target set selection tractable, An inclusion hierarchy of irreversible dynamos
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Size bounds for dynamic monopolies
- Local majorities, coalitions and monopolies in graphs: A review
- Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
- The power of small coalitions in graphs
- Dynamic monopolies of constant size
- Approximating average parameters of graphs
- A survey of gossiping and broadcasting in communication networks
- A simple model of global cascades on random networks
- Paths in graphs
- Probability Inequalities for Sums of Bounded Random Variables
- Exploring complex networks
- Probability and Computing
- Optimal irreversible dynamos in chordal rings
