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

DOI10.1007/978-3-319-03578-9_2zbMATH Open1362.68022MaRDI QIDQ2868628FDOQ2868628

Authors: David Ilcinkas, Ahmed M. Wade 

Publication date: 17 December 2013

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

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

zbMATH Keywords

mobile agentexplorationdynamic graphs\(T\)-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)

Cites Work

• Distributed computation in dynamic networks
• On the exploration of time-varying networks

Cited In (10)

• Gathering in dynamic rings
• Exploration of the \(T\)-interval-connected dynamic graphs: the case of the ring
• Self-stabilizing robots in highly dynamic environments
• Exploring a Dynamic Ring Without Landmark
• Exploration of \(k\)-edge-deficient temporal graphs
• Distributed exploration of dynamic rings
• Exploration of dynamic tori by multiple agents
• Exploration of \(k\)-edge-deficient temporal graphs
• Exploring a dynamic ring without landmark
• Non-strict Temporal Exploration

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 Q2868628)