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

DOI10.1007/S00224-017-9796-3MaRDI QIDQ722206zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

mobile agentexplorationdynamic graphsT-interval-connectivity

Mathematics Subject Classification ID

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)

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

Cites work

• An introduction to temporal graphs: an algorithmic perspective
• Causality, influence, and computation in possibly disconnected synchronous dynamic networks
• DMVP: Foremost Waypoint Coverage of Time-Varying Graphs
• Distributed computation in dynamic networks
• Exploration of constantly connected dynamic graphs based on cactuses
• Exploration of the \(T\)-interval-connected dynamic graphs: the case of the ring
• On the exploration of time-varying networks
• Searching for black holes in subways
• Traveling salesman problems in temporal graphs

Cited in

(10)

• Efficiently testing \(T\)-interval connectivity in dynamic graphs
• Two moves per time step make a difference
• 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
• Parameterised temporal exploration problems
• Exploration of dynamic ring networks by a single agent with the H-hops and S-time steps view
• 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)