Distributed exploration of dynamic rings
From MaRDI portal
Publication:2174251
DOI10.1007/s00446-018-0339-1zbMath1433.68054arXiv1512.05306OpenAlexW2888048527WikidataQ129359859 ScholiaQ129359859MaRDI QIDQ2174251
Paola Flocchini, Nicola Santoro, Stefan Dobrev, Giuseppe Antonio Di Luna
Publication date: 21 April 2020
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1512.05306
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14)
Related Items (13)
Exploring a dynamic ring without landmark ⋮ Distributed exploration of dynamic rings ⋮ Beyond Rings: Gathering in 1-Interval Connected Graphs ⋮ Non-strict Temporal Exploration ⋮ Exploration of Time-Varying Connected Graphs with Silent Agents ⋮ Efficient live exploration of a dynamic ring with mobile robots ⋮ Simple, strict, proper, happy: a study of reachability in temporal graphs ⋮ Cops \& robber on periodic temporal graphs: characterization and improved bounds ⋮ Invited paper: Simple, strict, proper, happy: a study of reachability in temporal graphs ⋮ Exploration of carrier-based time-varying networks: the power of waiting ⋮ Exploration of dynamic networks: tight bounds on the number of agents ⋮ Exploration of dynamic cactuses with sub-logarithmic overhead ⋮ Temporal cliques admit sparse spanners
Cites Work
- Traveling salesman problems in temporal graphs
- Efficient routing in carrier-based mobile networks
- Parsimonious flooding in dynamic graphs
- Searching for black holes in subways
- Exploring an unknown dangerous graph with a constant number of tokens
- Election and rendezvous with incomparable labels
- Dynamic graph models
- On the exploration of time-varying networks
- Exploring an unknown dangerous graph using tokens
- Searching for a black hole in arbitrary networks: optimal mobile agents protocols
- Distributed exploration of dynamic rings
- Map construction of unknown graphs by multiple agents
- Graph exploration by a finite automaton
- On temporal graph exploration
- Exploration of the T-Interval-Connected Dynamic Graphs: The Case of the Ring
- Distributed computation in dynamic networks
- Coordinated consensus in dynamic networks
- Shortest, Fastest, and Foremost Broadcast in Dynamic Networks
- How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
- Exploring an unknown graph
- Exploring Unknown Undirected Graphs
- Exploring Unknown Environments
- Deterministic Network Exploration by Anonymous Silent Agents with Local Traffic Reports
- Fast byzantine agreement in dynamic networks
- Measuring Temporal Lags in Delay-Tolerant Networks
- Exploration of Constantly Connected Dynamic Graphs Based on Cactuses
- COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
- Gathering in dynamic rings
This page was built for publication: Distributed exploration of dynamic rings
