Close-to-optimal and near-optimal broadcasting in random graphs

DOI10.1016/0166-218X(95)00004-BMaRDI QIDQ1902897zbMATH OpenFDO

Authors A. V. Gerbessiotis

Publication date 12 March 1996

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

Full work available at URL https://doi.org/10.1016/0166-218X(95)00004-B

zbMATH Keywords

broadcasting in random graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Communication networks in operations research (90B18) Applications of graph theory to circuits and networks (94C15)

Recommendations

• Broadcasting in random graphs
• On the runtime and robustness of randomized broadcasting
• Optimal and near-optimal broadcast in random graphs
• Broadcasting in random graphs
• On the Runtime and Robustness of Randomized Broadcasting

Cites work

• A dense infinite Sidon sequence
• Broadcasting in random graphs
• Fast probabilistic algorithms for Hamiltonian circuits and matchings
• scientific article; zbMATH DE number 4170917 (Why is no real title available?)
• scientific article; zbMATH DE number 3904630 (Why is no real title available?)
• scientific article; zbMATH DE number 3400923 (Why is no real title available?)
• Optimal and near-optimal broadcast in random graphs

Cited in

(15)

• Perfect broadcasting in unlabeled networks
• Probabilistic flooding for efficient information dissemination in random graph topologies
• The unit acquisition number of binomial random graphs
• Broadcasting on paths and cycles
• The total acquisition number of random geometric graphs
• The total acquisition number of random graphs
• Analysis in distribution of two randomized algorithms for finding the maximum in a broadcast communication model
• Broadcasting on Random Directed Acyclic Graphs
• An Asymptotically Optimal Push–Pull Method for Multicasting Over a Random Network
• scientific article; zbMATH DE number 6297797 (Why is no real title available?)
• Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems
• Broadcasting in random graphs
• Broadcasting in random graphs
• Optimal Broadcast with Partial Knowledge
• Optimal and near-optimal broadcast in random graphs

This page was built for publication: Close-to-optimal and near-optimal broadcasting in random graphs

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