Exploration of the \(T\)-interval-connected dynamic graphs: the case of the ring

DOI10.1007/s00224-017-9796-3zbMath1392.68099OpenAlexW68025998MaRDI QIDQ722206

David Ilcinkas, Ahmed M. Wade

Publication date: 23 July 2018

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-017-9796-3

zbMATH Keywords

mobile agentexplorationdynamic graphsT-interval-connectivity

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Distributed systems (68M14)

Related Items (7)

On temporal graph exploration ⋮ Efficient live exploration of a dynamic ring with mobile robots ⋮ Exploration of carrier-based time-varying networks: the power of waiting ⋮ Parameterised temporal exploration problems ⋮ Exploration of dynamic networks: tight bounds on the number of agents ⋮ Unnamed Item ⋮ Exploration of dynamic cactuses with sub-logarithmic overhead

Cites Work

• Traveling salesman problems in temporal graphs
• Searching for black holes in subways
• Causality, influence, and computation in possibly disconnected synchronous dynamic networks
• On the exploration of time-varying networks
• On temporal graph exploration
• Exploration of the T-Interval-Connected Dynamic Graphs: The Case of the Ring
• Distributed computation in dynamic networks
• DMVP: Foremost Waypoint Coverage of Time-Varying Graphs
• Exploration of Constantly Connected Dynamic Graphs Based on Cactuses
• An Introduction to Temporal Graphs: An Algorithmic Perspective^*
• Self-stabilizing robots in highly dynamic environments

This page was built for publication: Exploration of the \(T\)-interval-connected dynamic graphs: the case of the ring