On the exploration of time-varying networks
From MaRDI portal
Publication:1935801
DOI10.1016/j.tcs.2012.10.029zbMath1258.68103OpenAlexW2014679376MaRDI 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 networksmobile agentsdynamic networksexplorationtime-varying graphstraversalcarrier networksdelay-tolerant networksevolving graphs
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Transversal (matching) theory (05D15) Graph theory (05C99) Agent technology and artificial intelligence (68T42)
Related Items
As Time Goes By: Reflections on Treewidth for Temporal Graphs, Exploring a dynamic ring without landmark, Distributed exploration of dynamic rings, Shortest, Fastest, and Foremost Broadcast in Dynamic Networks, Temporal interval cliques and independent sets, Non-strict Temporal Exploration, Efficient live exploration of a dynamic ring with mobile robots, How fast can we reach a target vertex in stochastic temporal graphs?, Cops \& robber on periodic temporal graphs: characterization and improved bounds, 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 multiaspect graphs, Computing parameters of sequence-based dynamic graphs, Temporal graph classes: a view through temporal separators, Exploration of the \(T\)-interval-connected dynamic graphs: the case of the ring, On the treewidth of dynamic graphs, How fast can we reach a target vertex in stochastic temporal graphs, An Introduction to Temporal Graphs: An Algorithmic Perspective*, Exploration of the T-Interval-Connected Dynamic Graphs: The Case of the Ring, On the expressivity of time-varying graphs
