On the complexity of information spreading in dynamic networks

DOI10.1137/1.9781611973105.52MaRDI QIDQ5741760zbMATH OpenOpenAlexFDO

Authors Chinmoy Dutta, Gopal Pandurangan, Rajmohan Rajaraman, Zhifeng Sun, Emanuele Viola

Publication date 15 May 2019

Published in Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611973105.52

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15) Randomized algorithms (68W20) Analysis of algorithms (68W40)

Recommendations

• Information spreading in dynamic networks under oblivious adversaries
• Lower bounds on information dissemination in dynamic networks
• The cost of global broadcast in dynamic radio networks
• Fast distributed computation in dynamic networks via random walks
• Faster information dissemination in dynamic networks via network coding

Cited in

(32)

• Diffusion processes of fragmentary information on scale-free networks
• Dynamics analysis of epidemic and information spreading in overlay networks
• Information spreading in dynamic networks under oblivious adversaries
• On linear-time data dissemination in dynamic rooted trees
• Temporal network optimization subject to connectivity constraints
• Token dissemination in geometric dynamic networks
• Exploration of dynamic cactuses with sub-logarithmic overhead
• Knowledge diffusion in complex networks by considering time-varying information channels
• Some lower bounds in dynamic networks with oblivious adversaries
• Distributed computation in dynamic networks via random walks
• On the expressivity of time-varying graphs
• The complexity of optimal design of temporally connected graphs
• Traveling salesman problems in temporal graphs
• Faster information dissemination in dynamic networks via network coding
• Fast distributed computation in dynamic networks via random walks
• Lower bounds on information dissemination in dynamic networks
• On verifying and maintaining connectivity of interval temporal networks
• scientific article; zbMATH DE number 6318810 (Why is no real title available?)
• The communication complexity of addition
• Minimum Weight Dynamo and Fast Opinion Spreading
• Brief Announcement
• An introduction to temporal graphs: an algorithmic perspective
• Brief Announcement: Efficient Computation in Congested Anonymous Dynamic Networks
• Models of smoothing in dynamic networks
• Adaptive collective responses to local stimuli in anonymous dynamic networks
• Early adapting to trends: self-stabilizing information spread using passive communication
• Smoothed analysis of information spreading in dynamic networks
• Efficient computation in congested anonymous dynamic networks
• Efficient computation in congested anonymous dynamic networks
• On information aggregation and interim efficiency in networks
• Measures for information propagation in Boolean networks
• Causality, influence, and computation in possibly disconnected synchronous dynamic networks

This page was built for publication: On the complexity of information spreading in dynamic networks

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