On the exploration of time-varying networks

DOI10.1016/J.TCS.2012.10.029MaRDI QIDQ1935801zbMATH OpenOpenAlexFDO

Authors P. Flocchini, Bernard Mans, N. Santoro

Publication date 19 February 2013

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2012.10.029

zbMATH Keywords

carrier networksdelay-tolerant networksdynamic networksevolving graphsexplorationmobile agentsmobile networkstime-varying graphstraversal

Mathematics Subject Classification ID

Graph theory (05C99) Transversal (matching) theory (05D15) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Agent technology and artificial intelligence (68T42)

Recommendations

• Estimating time-varying networks
• Time-varying network models
• Time series modeling on dynamic networks
• Dynamic networks with multi-scale temporal structure
• Modeling Time-Varying Random Objects and Dynamic Networks
• Dynamic flows in time-varying networks.
• Time-dependent simple temporal networks: properties and algorithms
• Probing complex networks from measured time series

Cited in

(32)

• Computing parameters of sequence-based dynamic graphs
• Exploring a dynamic ring without landmark
• Distributed exploration of dynamic rings
• How fast can we reach a target vertex in stochastic temporal graphs?
• Exploration of carrier-based time-varying networks: the power of waiting
• Exploration of dynamic tori by multiple agents
• Exploration of dynamic networks: tight bounds on the number of agents
• On the expressivity of time-varying graphs
• Exploration of the \(T\)-interval-connected dynamic graphs: the case of the ring
• Shortest, fastest, and foremost broadcast in dynamic networks
• Deterministic computations in time-varying graphs: broadcasting under unstructured mobility
• Exploration of periodically varying graphs
• As Time Goes By: Reflections on Treewidth for Temporal Graphs
• How fast can we reach a target vertex in stochastic temporal graphs?
• Non-strict Temporal Exploration
• On multiaspect graphs
• An introduction to temporal graphs: an algorithmic perspective
• Brief announcement: Waiting in dynamic networks
• Temporal interval cliques and independent sets
• Efficient live exploration of a dynamic ring with mobile robots
• Modeling Time-Varying Random Objects and Dynamic Networks
• Cops \& robber on periodic temporal graphs: characterization and improved bounds
• Exploring a Dynamic Ring Without Landmark
• Exploration of dynamic ring networks by a single agent with the H-hops and S-time steps view
• Broadcasting with mobile agents in dynamic networks
• Cops \& Robber on periodic temporal graphs
• On the broadcast problem for mobile agents in dynamic networks
• Path connected dynamic graphs with a study of dispersion and exploration
• Resolving sets in temporal graphs
• Exploration of the T-interval-connected dynamic graphs: the case of the ring
• COP numbers of periodic graphs
• On the treewidth of dynamic graphs

This page was built for publication: On the exploration of time-varying networks

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