On linear-time data dissemination in dynamic rooted trees
type: Item
instance of: scholarly article
title: On linear-time data dissemination in dynamic rooted trees
zbMATH Open document ID: 1417.68016
author: Martin Zeiner
author: Manfred Schwarz
author: Ulrich Schmid
published in: Discrete Applied Mathematics
publication date: 2019-02-20T00:00:00Z
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 7027145
zbMATH Keywords: directed graphs
zbMATH Keywords: rooted trees
zbMATH Keywords: graph sequences
zbMATH Keywords: dynamic networks
zbMATH Keywords: data dissemination
zbMATH Keywords: broadcasting
MaRDI profile type: Publication
full work available at URL: j.dam.2018.08.015
OpenAlex ID: W2897525529
cites work: The Cost of Global Broadcast in Dynamic Radio Networks.
cites work: Efficient construction of broadcast graphs
cites work: Gossips and telephones
cites work: Optimal multiple message broadcasting in telephone-like communication systems
cites work: Parsimonious flooding in dynamic graphs
cites work: The Worst Case Behavior of Randomized Gossip
cites work: The worst case behavior of randomized gossip protocols
cites work: A Note on the Dimensionality of Modified Knödel Graphs
cites work: Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks
cites work: Approximate Consensus in Highly Dynamic Networks: The Role of Averaging Algorithms
cites work: Rumor spreading in random evolving graphs
cites work: Flooding Time of Edge-Markovian Evolving Graphs
cites work: Broadcasting in dynamic radio networks
cites work: Information spreading in dynamic graphs
cites work: Social networks spread rumors in sublogarithmic time
cites work: Asynchronous Rumor Spreading in Preferential Attachment Graphs
cites work: Q3579453
cites work: Strong robustness of randomized rumor spreading protocols
cites work: Broadcast in the rendezvous model
cites work: On the Complexity of Information Spreading in Dynamic Networks
cites work: On Radio Broadcasting in Random Geometric Graphs
cites work: Radio communication in random graphs
cites work: On the runtime and robustness of randomized broadcasting
cites work: Minimum broadcast graphs
cites work: Randomized broadcast in networks
cites work: Optimal algorithms for dissemination of information in generalized communication modes
cites work: Methods and problems of communication in usual networks
cites work: Diameter and broadcast time of random geometric graphs in arbitrary dimensions
cites work: The shortest-path problem for graphs with random arc-lengths
cites work: Broadcasting in random graphs
cites work: Randomized Rumor Spreading in Dynamic Graphs
cites work: A New Construction of Broadcast Graphs
cites work: Broadcast Graphs Using New Dimensional Broadcast Schemes for Knödel Graphs
cites work: More broadcast graphs
cites work: A survey of gossiping and broadcasting in communication networks
cites work: Q4870160
cites work: On generalized gossiping and broadcasting
cites work: New gossips and telephones
cites work: Broadcasting in unreliable radio networks
cites work: Distributed computation in dynamic networks
cites work: Extremal broadcasting problems
cites work: Q3487440
cites work: Faster rumor spreading with multiple calls
cites work: Asynchronous rumor spreading on random graphs
cites work: Feasibility and complexity of broadcasting with random transmission failures
cites work: On Spreading a Rumor
cites work: A class of solutions to the gossip problem. I
cites work: A class of solutions to the gossip problem. II
cites work: A class of solutions to the gossip problem. III
DOI: 10.1016/J.DAM.2018.08.015
description: scientific article; zbMATH DE number 7027145