Exploration of the T-interval-connected dynamic graphs: the case of the ring
From MaRDI portal
Publication:2868628
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
Cited in
(13)- Gathering in dynamic rings
- Efficiently testing \(T\)-interval connectivity in dynamic graphs
- Exploration of the T-interval-connected dynamic graphs: the case of the ring
- Exploring a Dynamic Ring Without Landmark
- Exploration of dynamic cactuses with sub-logarithmic overhead
- Exploration of \(k\)-edge-deficient temporal graphs
- Distributed exploration of dynamic rings
- Exploration of dynamic tori by multiple agents
- Exploration of constantly connected dynamic graphs based on cactuses
- Exploring a dynamic ring without landmark
- Exploration of \(k\)-edge-deficient temporal graphs
- Non-strict Temporal Exploration
- Exploration of dynamic ring networks by a single agent with the H-hops and S-time steps view
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)