Exploration of dynamic networks: tight bounds on the number of agents
From MaRDI portal
(Redirected from Publication:2229946)
Recommendations
- Deterministic network exploration by a single agent with Byzantine tokens
- Using a collective of agents for exploration of undirected graphs
- Tight bounds for undirected graph exploration with pebbles and multiple agents
- Exploration of Time-Varying Connected Graphs with Silent Agents
- Deterministic network exploration by anonymous silent agents with local traffic reports
- Deterministic Network Exploration by Anonymous Silent Agents with Local Traffic Reports
- Graph theoretic methods in multiagent networks
- Approximating network dynamics: some open problems
- Dynamic random networks and their graph limits
Cites work
- A distributed ant algorithm for efficiently patrolling a network
- A game of cops and robbers on graphs with periodic edge-connectivity
- Coordinated consensus in dynamic networks
- Deterministic Network Exploration by Anonymous Silent Agents with Local Traffic Reports
- Deterministic computations in time-varying graphs: broadcasting under unstructured mobility
- Distributed Algorithms For Unidirectional Networks
- Distributed computation in dynamic networks
- Distributed exploration of dynamic rings
- Does adding more agents make a difference? A case study of cover time for the rotor-router
- Dynamic graph models
- Economic Traversal of Labyrinths
- Exploration of High-Dimensional Grids by Finite Automata
- Exploration of constantly connected dynamic graphs based on cactuses
- Exploration of the T-interval-connected dynamic graphs: the case of the ring
- Exploring Unknown Environments
- Exploring Unknown Undirected Graphs
- Exploring an unknown graph
- Faster exploration of degree-bounded temporal graphs
- Gathering in dynamic rings
- Gracefully degrading gathering in dynamic rings
- Graph exploration by a finite automaton
- How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
- Impact of memory size on graph exploration capability
- Label-guided graph exploration by a finite automaton
- Lower bounds on information dissemination in dynamic networks
- Measuring Temporal Lags in Delay-Tolerant Networks
- Network exploration by silent and oblivious robots
- On the exploration of time-varying networks
- Robustness of the rotor-router mechanism
- Searching for black holes in subways
- Traveling salesman problems in temporal graphs
- Two moves per time step make a difference
Cited in
(9)- Black hole search in dynamic cactus graph
- Cops \& robber on periodic temporal graphs: characterization and improved bounds
- Invited paper: One bit agent memory is enough for snap-stabilizing perpetual exploration of cactus graphs with distinguishable cycles
- Beyond rings: gathering in 1-interval connected graphs
- Exploring a Dynamic Ring Without Landmark
- Exploring a dynamic ring without landmark
- Non-strict Temporal Exploration
- Exploration of a finite graph by a collective of agents
- Deterministic Network Exploration by Anonymous Silent Agents with Local Traffic Reports
This page was built for publication: Exploration of dynamic networks: tight bounds on the number of agents
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2229946)
