Spreading messages

DOI10.1016/J.TCS.2009.03.032zbMATH Open1172.68003OpenAlexW2913116953MaRDI QIDQ1029342FDOQ1029342

Authors: 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

Recommendations

• Spreading Messages
• Spreading of messages in random graphs
• Variants of spreading messages
• Variants of spreading messages
• Evangelism in social networks: algorithms and complexity

zbMATH Keywords

global cascadeirreversible dynamotrust propagation

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Cites Work

• Probability Inequalities for Sums of Bounded Random Variables
• Title not available (Why is that?)
• Exploring complex networks
• Local majorities, coalitions and monopolies in graphs: A review
• Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
• A survey of gossiping and broadcasting in communication networks
• Paths in graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Probability and Computing
• Size bounds for dynamic monopolies
• Approximating average parameters of graphs
• The power of small coalitions in graphs
• Title not available (Why is that?)
• Dynamic monopolies of constant size
• Optimal irreversible dynamos in chordal rings
• A simple model of global cascades on random networks

Cited In (17)

• On non-progressive spread of influence through social networks
• Combinatorial model and bounds for target set selection
• On dynamic monopolies of graphs with general thresholds
• Triggering cascades on undirected connected graphs
• On dynamic monopolies of graphs: the average and strict majority thresholds
• Title not available (Why is that?)
• On dynamic monopolies of graphs with probabilistic thresholds
• Variants of spreading messages
• Constant thresholds can make target set selection tractable
• Dynamic monopolies in directed graphs: the spread of unilateral influence in social networks
• On reversible cascades in scale-free and Erdős-Rényi random graphs
• An inclusion hierarchy of irreversible dynamos
• Parameterized approximability of maximizing the spread of influence in networks
• Variants of spreading messages
• Spreading Messages
• Dynamic monopolies with randomized starting configuration
• Spreading of messages in random graphs

This page was built for publication: Spreading messages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1029342)