On Randomized Broadcasting in Power Law Networks

DOI10.1007/11864219_26MaRDI QIDQ3524319zbMATH OpenOpenAlexFDO

Authors Robert Elsässer

Publication date 9 September 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11864219_26

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20) Network design and communication in computer systems (68M10)

Recommendations

• Efficient broadcasting in random power law networks
• On Radio Broadcasting in Random Geometric Graphs
• Radio communication in random graphs
• Fast message dissemination in random geometric networks
• Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems

Cited in

(8)

• Ultra-fast rumor spreading in social networks
• Multicast tree structure and the power law
• Efficient broadcasting in random power law networks
• Fast message dissemination in random geometric networks
• The role of randomness in the broadcast congested clique model
• Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems
• An Asymptotically Optimal Push–Pull Method for Multicasting Over a Random Network
• Randomized broadcast in networks

This page was built for publication: On Randomized Broadcasting in Power Law Networks

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