Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs

DOI10.1007/978-3-540-70918-3_15zbMath1186.68336OpenAlexW2100307883MaRDI QIDQ3590930

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

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Related Items (10)

On the runtime and robustness of randomized broadcasting ⋮ On mixing and edge expansion properties in randomized broadcasting ⋮ Diameter and broadcast time of random geometric graphs in arbitrary dimensions ⋮ Randomised broadcasting: memory vs. randomness ⋮ Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems ⋮ On Mixing and Edge Expansion Properties in Randomized Broadcasting ⋮ The worst case behavior of randomized gossip protocols ⋮ Asymptotically Optimal Randomized Rumor Spreading ⋮ Introducing Quasirandomness to Computer Science ⋮ Unnamed Item

This page was built for publication: Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs