Shortest, Fastest, and Foremost Broadcast in Dynamic Networks

DOI10.1142/S0129054115500288zbMath1332.68012arXiv1210.3277OpenAlexW2963927168MaRDI QIDQ2947805

Bernard Mans, Paola Flocchini, Arnaud Casteigts, Nicola Santoro

Publication date: 29 September 2015

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

distributed algorithmdynamic networkstime-varying graphsdelay-tolerant broadcastrecurrent edges

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (6)

Distributed exploration of dynamic rings ⋮ Brief Announcement: Efficient Computation in Congested Anonymous Dynamic Networks ⋮ Computing parameters of sequence-based dynamic graphs ⋮ The complexity of data aggregation in static and dynamic wireless sensor networks ⋮ The Complexity of Data Aggregation in Static and Dynamic Wireless Sensor Networks ⋮ Foremost non-stop journey arrival in linear time

Cites Work

• Searching for black holes in subways
• Termination detection for diffusing computations
• On the exploration of time-varying networks
• The computational power of population protocols
• Computation in networks of passively mobile finite-state sensors
• Measuring Temporal Lags in Delay-Tolerant Networks
• Information Propagation Speed in Mobile and Delay Tolerant Networks
• COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS

This page was built for publication: Shortest, Fastest, and Foremost Broadcast in Dynamic Networks