On randomized broadcasting in star graphs

DOI10.1016/J.DAM.2008.05.018zbMATH Open1155.90007OpenAlexW2080586782MaRDI QIDQ1003763FDOQ1003763

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

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

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)

Cites Work

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

Cited In (12)

• Title not available (Why is that?)
• 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
• Graph-Theoretic Concepts in Computer Science
• On Mixing and Edge Expansion Properties in Randomized Broadcasting
• The worst case behavior of randomized gossip protocols
• 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)