Efficient Broadcasting in Random Power Law Networks

DOI10.1007/978-3-642-16926-7_26zbMath1309.68149OpenAlexW1520930364MaRDI QIDQ3057632

Adrian Ogierman, Robert Elsässer

Publication date: 16 November 2010

Published in: Graph Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-16926-7_26

zbMATH Keywords

broadcastingpower law graphs

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) Internet topics (68M11)

Related Items (1)

Randomised broadcasting: memory vs. randomness

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A guided tour of Chernoff bounds
• The shortest-path problem for graphs with random arc-lengths
• Randomized broadcast in networks
• On Randomized Broadcasting in Power Law Networks
• On Spreading a Rumor
• The Structure and Function of Complex Networks
• On Mixing and Edge Expansion Properties in Randomized Broadcasting
• On the Runtime and Robustness of Randomized Broadcasting
• Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems

This page was built for publication: Efficient Broadcasting in Random Power Law Networks