On randomized broadcasting in star graphs

DOI10.1016/J.DAM.2008.05.018MaRDI QIDQ1003763zbMATH OpenOpenAlexFDO

Authors Thomas Sauerwald, Robert Elsässer, Ulf Lorenz

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 theory (94A05) Communication networks in operations research (90B18) Applications of graph theory to circuits and networks (94C15) Network design and communication in computer systems (68M10)

Recommendations

• Graph-Theoretic Concepts in Computer Science
• On the Runtime and Robustness of Randomized Broadcasting
• On the runtime and robustness of randomized broadcasting
• Radio communication in random graphs
• Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs

Cites work

• scientific article; zbMATH DE number 52113 (Why is no real title available?)
• scientific article; zbMATH DE number 1151379 (Why is no real title available?)
• A group-theoretic model for symmetric interconnection networks
• A guided tour of Chernoff bounds
• Bisection width of transposition graphs
• Constructing integral uniform flows in symmetric networks with application to the edge-forwarding index problem
• Edge-disjoint spanning trees on the star network with applications to fault tolerance
• Embedding meshes on the star graph
• On Spreading a Rumor
• On the Runtime and Robustness of Randomized Broadcasting
• On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
• Optimal Assignments of Numbers to Vertices
• Probability and Computing
• Randomized broadcast in networks
• The mathematics of infectious diseases

Cited in

(12)

• scientific article; zbMATH DE number 5139470 (Why is no real title available?)
• Bit complexity of order statistics on a distributed star network
• On the Runtime and Robustness of Randomized Broadcasting
• On the runtime and robustness of randomized broadcasting
• Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs
• The worst case behavior of randomized gossip protocols
• Graph-Theoretic Concepts in Computer Science
• On Mixing and Edge Expansion Properties in Randomized Broadcasting
• Messy broadcasting - decentralized broadcast schemes with limited knowledge
• Broadcasting in random graphs
• Two-disjoint-cycle-cover edge/vertex bipancyclicity of star graphs
• On mixing and edge expansion properties in randomized broadcasting

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

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