Deterministic Computations in Time-Varying Graphs: Broadcasting under Unstructured Mobility

DOI10.1007/978-3-642-15240-5_9zbMath1202.68020OpenAlexW1609474097MaRDI QIDQ3163877

Bernard Mans, Nicola Santoro, Paola Flocchini, Arnaud Casteigts

Publication date: 27 October 2010

Published in: IFIP Advances in Information and Communication Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15240-5_9

zbMATH Keywords

evolving graphsdelay-tolerantdisruptive-tolerant

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (7)

Exploration of dynamic networks: tight bounds on the number of agents ⋮ Searching for black holes in subways ⋮ Enabling Minimal Dominating Set in Highly Dynamic Distributed Systems ⋮ On the treewidth of dynamic graphs ⋮ On the expressivity of time-varying graphs ⋮ Distributed agreement in dynamic peer-to-peer networks ⋮ Synchronous concurrent broadcasts for intermittent channels with bounded capacities

This page was built for publication: Deterministic Computations in Time-Varying Graphs: Broadcasting under Unstructured Mobility