Lower Bounds on Information Dissemination in Dynamic Networks

DOI10.1007/978-3-642-33651-5_12zbMath1377.68021arXiv1208.6051OpenAlexW1570690262MaRDI QIDQ4909409

Fabian Kuhn, Bernhard Haeupler

Publication date: 13 March 2013

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

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

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (6)

An Introduction to Temporal Graphs: An Algorithmic Perspective ⋮ Brief Announcement: Efficient Computation in Congested Anonymous Dynamic Networks ⋮ Exploration of dynamic networks: tight bounds on the number of agents ⋮ Gathering in dynamic rings ⋮ Message and time efficient multi-broadcast schemes ⋮ An Introduction to Temporal Graphs: An Algorithmic Perspective^*

This page was built for publication: Lower Bounds on Information Dissemination in Dynamic Networks