Exploration of the T-interval-connected dynamic graphs: the case of the ring
DOI10.1007/S00224-017-9796-3zbMATH Open1392.68099OpenAlexW68025998MaRDI QIDQ722206FDOQ722206
Authors: 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
Recommendations
- Exploration of the \(T\)-interval-connected dynamic graphs: the case of the ring
- Exploration of constantly connected dynamic graphs based on cactuses
- Efficiently testing \(T\)-interval connectivity in dynamic graphs
- Exploration of dynamic cactuses with sub-logarithmic overhead
- Distributed computation in dynamic networks
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Network design and communication in computer systems (68M10) Distributed systems (68M14)
Cites Work
- Traveling salesman problems in temporal graphs
- Distributed computation in dynamic networks
- Causality, influence, and computation in possibly disconnected synchronous dynamic networks
- On the exploration of time-varying networks
- Searching for black holes in subways
- Exploration of the \(T\)-interval-connected dynamic graphs: the case of the ring
- 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
Cited In (10)
- Two moves per time step make a difference
- Efficiently testing \(T\)-interval connectivity in dynamic graphs
- Exploration of the \(T\)-interval-connected dynamic graphs: the case of the ring
- Exploration of dynamic cactuses with sub-logarithmic overhead
- Efficient live exploration of a dynamic ring with mobile robots
- Exploration of constantly connected dynamic graphs based on cactuses
- Exploration of dynamic networks: tight bounds on the number of agents
- Exploration of dynamic ring networks by a single agent with the H-hops and S-time steps view
- Parameterised temporal exploration problems
- Exploration of carrier-based time-varying networks: the power of waiting
This page was built for publication: Exploration of the \(T\)-interval-connected dynamic graphs: the case of the ring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q722206)
