On linear-time data dissemination in dynamic rooted trees
From MaRDI portal
Publication:1727754
DOI10.1016/j.dam.2018.08.015zbMath1417.68016OpenAlexW2897525529MaRDI QIDQ1727754
Ulrich Schmid, Martin Zeiner, Manfred Schwarz
Publication date: 20 February 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2018.08.015
Trees (05C05) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Diameter and broadcast time of random geometric graphs in arbitrary dimensions
- The worst case behavior of randomized gossip protocols
- Parsimonious flooding in dynamic graphs
- A class of solutions to the gossip problem. III
- On the runtime and robustness of randomized broadcasting
- Feasibility and complexity of broadcasting with random transmission failures
- Broadcasting in dynamic radio networks
- The shortest-path problem for graphs with random arc-lengths
- Extremal broadcasting problems
- A class of solutions to the gossip problem. I
- A class of solutions to the gossip problem. II
- New gossips and telephones
- Minimum broadcast graphs
- Optimal algorithms for dissemination of information in generalized communication modes
- Methods and problems of communication in usual networks
- Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks
- Strong robustness of randomized rumor spreading protocols
- More broadcast graphs
- Optimal multiple message broadcasting in telephone-like communication systems
- Faster rumor spreading with multiple calls
- Asynchronous rumor spreading on random graphs
- Efficient construction of broadcast graphs
- Radio communication in random graphs
- Broadcast in the rendezvous model
- Gossips and telephones
- Rumor spreading in random evolving graphs
- A New Construction of Broadcast Graphs
- Distributed computation in dynamic networks
- The Worst Case Behavior of Randomized Gossip
- Asynchronous Rumor Spreading in Preferential Attachment Graphs
- Broadcast Graphs Using New Dimensional Broadcast Schemes for Knödel Graphs
- Flooding Time of Edge-Markovian Evolving Graphs
- Randomized broadcast in networks
- Approximate Consensus in Highly Dynamic Networks: The Role of Averaging Algorithms
- On Radio Broadcasting in Random Geometric Graphs
- On Spreading a Rumor
- A survey of gossiping and broadcasting in communication networks
- A Note on the Dimensionality of Modified Knödel Graphs
- Randomized Rumor Spreading in Dynamic Graphs
- Broadcasting in unreliable radio networks
- The Cost of Global Broadcast in Dynamic Radio Networks.
- Social networks spread rumors in sublogarithmic time
- On generalized gossiping and broadcasting
- On the Complexity of Information Spreading in Dynamic Networks
- Information spreading in dynamic graphs
- Broadcasting in random graphs
- Broadcasting in random graphs
This page was built for publication: On linear-time data dissemination in dynamic rooted trees
