Broadcasting in random graphs

DOI10.1016/0166-218X(94)00033-6MaRDI QIDQ5906597zbMATH OpenDBLPWikidataFDO

Authors Alan Frieze, Michael Molloy

Publication date 3 May 1995

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-218X(94)00033-6

zbMATH Keywords

random graphprobabilitybroadcast

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• Broadcasting in random graphs
• On the runtime and robustness of randomized broadcasting
• Optimal and near-optimal broadcast in random graphs
• Close-to-optimal and near-optimal broadcasting in random graphs
• On randomized broadcasting in star graphs

Cites work

• scientific article; zbMATH DE number 747032 (Why is no real title available?)
• scientific article; zbMATH DE number 3216216 (Why is no real title available?)
• Broadcasting in random graphs
• Optimal and near-optimal broadcast in random graphs

Cited in

(25)

• Broadcasts in graphs
• On linear-time data dissemination in dynamic rooted trees
• Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems
• Agent-based randomized broadcasting in large networks
• Perfect broadcasting in unlabeled networks
• Broadcasting in DMA-bound bounded degree graphs
• The total acquisition number of random geometric graphs
• Voronoi-like nondeterministic partition of a lattice by collectives of finite automata
• The total acquisition number of random graphs
• On Radio Broadcasting in Random Geometric Graphs
• scientific article; zbMATH DE number 1792638 (Why is no real title available?)
• Optimal and near-optimal broadcast in random graphs
• Constrained information transmission on Erdős-Rényi graphs
• Randomized broadcast in networks
• The unit acquisition number of binomial random graphs
• The worst case behavior of randomized gossip protocols
• Broadcasting on Random Directed Acyclic Graphs
• Bounds on broadcast time in well-connected graphs
• The role of randomness in the broadcast congested clique model
• Broadcasting in Bounded Degree Graphs
• Broadcasting in random graphs
• Probabilistic flooding for efficient information dissemination in random graph topologies
• Radio communication in random graphs
• scientific article; zbMATH DE number 6297797 (Why is no real title available?)
• Close-to-optimal and near-optimal broadcasting in random graphs

This page was built for publication: Broadcasting in random graphs

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