Path connected dynamic graphs with a study of dispersion and exploration
From MaRDI portal
Cites work
- Causality, influence, and computation in possibly disconnected synchronous dynamic networks
- Collaborative exploration of trees by energy-constrained mobile robots
- Collective tree exploration
- Dispersion of mobile robots on grids
- Distributed computation in dynamic networks
- Distributed exploration of dynamic rings
- 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
- Exploration of the T-interval-connected dynamic graphs: the case of the ring
- Fast Byzantine gathering with visibility in graphs
- Fast dispersion of mobile robots on arbitrary graphs
- How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
- LATIN 2004: Theoretical Informatics
- On temporal graph exploration
- On the exploration of time-varying networks
- Searching for black holes in subways
- Self-stabilizing robots in highly dynamic environments
- Uniform Deployment of Mobile Agents in Asynchronous Rings
This page was built for publication: Path connected dynamic graphs with a study of dispersion and exploration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6949562)
