Exploration on highly dynamic graphs
From MaRDI portal
Cites work
- Causality, influence, and computation in possibly disconnected synchronous dynamic networks
- Collective tree exploration
- Deterministic Network Exploration by Anonymous Silent Agents with Local Traffic Reports
- 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
- Exploring an unknown graph
- Exploring Unknown Environments
- Exploring Unknown Undirected Graphs
- Fast Byzantine gathering with visibility in graphs
- Graph exploration by a finite automaton
- How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
- scientific article; zbMATH DE number 727573 (Why is no real title available?)
- Impact of memory size on graph exploration capability
- Label-guided graph exploration by a finite automaton
- Network exploration by silent and oblivious robots
- On temporal graph exploration
- On the exploration of time-varying networks
- Path connected dynamic graphs with a study of dispersion and exploration
- Searching for black holes in subways
- Self-stabilizing robots in highly dynamic environments
- Two moves per time step make a difference
This page was built for publication: Exploration on highly dynamic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7410047)
