Characterizing Topological Assumptions of Distributed Algorithms in Dynamic Networks

DOI10.1007/978-3-642-11476-2_11zbMath1274.68681arXiv1102.5529OpenAlexW1560628231MaRDI QIDQ3408165

Serge Chaumette, Arnaud Casteigts, Afonso G. Ferreira

Publication date: 24 February 2010

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

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

zbMATH Keywords

local interactionsdistributed algorithmsdynamic networksevolving graphstopological assumptions

Mathematics Subject Classification ID

Distributed systems (68M14) Network protocols (68M12) Distributed algorithms (68W15)

Related Items (7)

Efficiently Testing $$T$$-Interval Connectivity in Dynamic Graphs ⋮ 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 ⋮ On the treewidth of dynamic graphs ⋮ Threshold-based network structural dynamics ⋮ On the expressivity of time-varying graphs

Cites Work

• The computational power of population protocols
• Computation in networks of passively mobile finite-state sensors
• Unnamed Item
• Unnamed Item

This page was built for publication: Characterizing Topological Assumptions of Distributed Algorithms in Dynamic Networks