Exploration of dynamic networks: tight bounds on the number of agents
From MaRDI portal
Publication:2229946
DOI10.1016/j.jcss.2021.04.003OpenAlexW3160973854MaRDI QIDQ2229946
Toshimitsu Masuzawa, Paola Flocchini, Tsuyoshi Gotoh, Nicola Santoro
Publication date: 17 September 2021
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2021.04.003
Related Items (4)
Exploring a dynamic ring without landmark ⋮ Beyond Rings: Gathering in 1-Interval Connected Graphs ⋮ Non-strict Temporal Exploration ⋮ Cops \& robber on periodic temporal graphs: characterization and improved bounds
Cites Work
- Unnamed Item
- Unnamed Item
- Traveling salesman problems in temporal graphs
- Searching for black holes in subways
- Exploration of the \(T\)-interval-connected dynamic graphs: the case of the ring
- Impact of memory size on graph exploration capability
- Dynamic graph models
- A distributed ant algorithm for efficiently patrolling a network
- On the exploration of time-varying networks
- Distributed exploration of dynamic rings
- Does adding more agents make a difference? A case study of cover time for the rotor-router
- Robustness of the rotor-router mechanism
- Graph exploration by a finite automaton
- On temporal graph exploration
- Distributed computation in dynamic networks
- Coordinated consensus in dynamic networks
- Network Exploration by Silent and Oblivious Robots
- Deterministic Computations in Time-Varying Graphs: Broadcasting under Unstructured Mobility
- A Game of Cops and Robbers on Graphs with Periodic Edge-Connectivity
- How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
- Distributed Algorithms For Unidirectional Networks
- Exploring an unknown graph
- Lower Bounds on Information Dissemination in Dynamic Networks
- Exploring Unknown Undirected Graphs
- Exploring Unknown Environments
- Deterministic Network Exploration by Anonymous Silent Agents with Local Traffic Reports
- Label-guided graph exploration by a finite automaton
- Exploration of High-Dimensional Grids by Finite Automata
- Measuring Temporal Lags in Delay-Tolerant Networks
- Exploration of Constantly Connected Dynamic Graphs Based on Cactuses
- Economic Traversal of Labyrinths
- Self-stabilizing robots in highly dynamic environments
- Gathering in dynamic rings
- Gracefully degrading gathering in dynamic rings
This page was built for publication: Exploration of dynamic networks: tight bounds on the number of agents
