On the exploration of time-varying networks
From MaRDI portal
Publication:1935801
DOI10.1016/j.tcs.2012.10.029zbMath1258.68103MaRDI QIDQ1935801
Nicola Santoro, Bernard Mans, Paola Flocchini
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
mobile networks; mobile agents; dynamic networks; exploration; time-varying graphs; traversal; carrier networks; delay-tolerant networks; evolving graphs
68M10: Network design and communication in computer systems
68R10: Graph theory (including graph drawing) in computer science
05D15: Transversal (matching) theory
05C99: Graph theory
68T42: Agent technology and artificial intelligence
Related Items
As Time Goes By: Reflections on Treewidth for Temporal Graphs, Non-strict Temporal Exploration, How fast can we reach a target vertex in stochastic temporal graphs, Temporal graph classes: a view through temporal separators, An Introduction to Temporal Graphs: An Algorithmic Perspective*, Temporal interval cliques and independent sets, On multiaspect graphs, Exploration of the \(T\)-interval-connected dynamic graphs: the case of the ring, On the treewidth of dynamic graphs, 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
