Bounds for algebraic gossip on graphs

DOI10.1002/rsa.20480zbMath1301.05164arXiv1001.3265OpenAlexW2963370966MaRDI QIDQ2925522

Chen Avin, Zvi Lotker, Michael Borokhovich

Publication date: 16 October 2014

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1001.3265

zbMATH Keywords

network capacitynetwork codingalgebraic gossipgossip algorithmsgossip

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)

Related Items (2)

Order optimal information spreading using algebraic gossip ⋮ Distributed computation in dynamic networks via random walks

Cites Work

• Queueing Modelling Fundamentals
• Linear network coding
• Analyzing network coding gossip made easy
• Probability and Computing
• Order optimal information spreading using algebraic gossip
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bounds for algebraic gossip on graphs