Deterministic computations in time-varying graphs: broadcasting under unstructured mobility

DOI10.1007/978-3-642-15240-5_9MaRDI QIDQ3163877zbMATH OpenOpenAlexFDO

Authors Bernard Mans, Arnaud Casteigts, P. Flocchini, N. Santoro

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

delay-tolerantdisruptive-tolerantevolving graphs

Mathematics Subject Classification ID

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

Recommendations

• Shortest, fastest, and foremost broadcast in dynamic networks
• Distributed computation in dynamic networks
• On the exploration of time-varying networks
• Deterministic broadcasting in ad hoc radio networks
• Expressivity of Time-Varying Graphs

Cited in

(11)

• On computing the latest starting times and floats of activities in a network with imprecise durations
• Synchronous concurrent broadcasts for intermittent channels with bounded capacities
• Exploration of dynamic networks: tight bounds on the number of agents
• On the expressivity of time-varying graphs
• Distributed agreement in dynamic peer-to-peer networks
• Shortest, fastest, and foremost broadcast in dynamic networks
• Enabling minimal dominating set in highly dynamic distributed systems
• Brief announcement: Waiting in dynamic networks
• Searching for black holes in subways
• Memory lower bounds and impossibility results for anonymous dynamic broadcast
• On the treewidth of dynamic graphs

This page was built for publication: Deterministic computations in time-varying graphs: broadcasting under unstructured mobility

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