Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs
DOI10.1007/978-3-540-70918-3_15zbMATH Open1186.68336OpenAlexW2100307883MaRDI QIDQ3590930FDOQ3590930
Authors: Robert Elsässer, Thomas Sauerwald 
Publication date: 3 September 2007
Published in: STACS 2007 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-70918-3_15
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)
Cited In (13)
- Randomised broadcasting: memory vs. randomness
- Asymptotically optimal randomized rumor spreading
- Introducing Quasirandomness to Computer Science
- Broadcasting on recursively decomposable Cayley graphs
- Title not available (Why is that?)
- On the runtime and robustness of randomized broadcasting
- Graph-Theoretic Concepts in Computer Science
- On Mixing and Edge Expansion Properties in Randomized Broadcasting
- The worst case behavior of randomized gossip protocols
- Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems
- On randomized broadcasting in star graphs
- Diameter and broadcast time of random geometric graphs in arbitrary dimensions
- On mixing and edge expansion properties in randomized broadcasting
This page was built for publication: Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3590930)
