On randomized broadcasting in star graphs

DOI10.1016/j.dam.2008.05.018zbMath1155.90007OpenAlexW2080586782MaRDI QIDQ1003763

Thomas Sauerwald, Ulf Lorenz, Robert Elsässer

Publication date: 4 March 2009

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

Full work available at URL: https://doi.org/10.1016/j.dam.2008.05.018

zbMATH Keywords

hypercubesstar graphsedge expansionrandomized broadcasting

Mathematics Subject Classification ID

Trees (05C05) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Applications of graph theory to circuits and networks (94C15) Communication theory (94A05)

Related Items (2)

Messy broadcasting - decentralized broadcast schemes with limited knowledge ⋮ The worst case behavior of randomized gossip protocols

Cites Work

• Unnamed Item
• Unnamed Item
• A guided tour of Chernoff bounds
• On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
• Embedding meshes on the star graph
• Bisection width of transposition graphs
• The Mathematics of Infectious Diseases
• Randomized broadcast in networks
• On Spreading a Rumor
• A group-theoretic model for symmetric interconnection networks
• Edge-disjoint spanning trees on the star network with applications to fault tolerance
• On the Runtime and Robustness of Randomized Broadcasting
• Probability and Computing
• Optimal Assignments of Numbers to Vertices
• Constructing integral uniform flows in symmetric networks with application to the edge-forwarding index problem

This page was built for publication: On randomized broadcasting in star graphs