Beyond Rings: Gathering in 1-Interval Connected Graphs
From MaRDI portal
Publication:5087065
DOI10.1142/S0129626421500201zbMath1490.68050OpenAlexW3211862663MaRDI QIDQ5087065
Michail Theofilatos, Othon Michail, Paul G. Spirakis
Publication date: 8 July 2022
Published in: Parallel Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129626421500201
Cites Work
- Unnamed Item
- Unnamed Item
- Rendezvous and election of mobile agents: Impact of sense of direction
- Causality, influence, and computation in possibly disconnected synchronous dynamic networks
- Distributed exploration of dynamic rings
- Move-optimal partial gathering of mobile agents without identifiers or global knowledge in asynchronous unidirectional rings
- Gathering of robots in a grid with mobile faults
- Exploration of dynamic tori by multiple agents
- Exploration of dynamic networks: tight bounds on the number of agents
- Asynchronous deterministic rendezvous in graphs
- Map construction of unknown graphs by multiple agents
- Deterministic rendezvous in graphs
- Distributed computation in dynamic networks
- How to meet asynchronously (almost) everywhere
- Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links
- The Power of Tokens: Rendezvous and Symmetry Detection for Two Mobile Agents in a Ring
- Structural Information and Communication Complexity
- Algorithms - ESA 2003
- Gathering in dynamic rings
This page was built for publication: Beyond Rings: Gathering in 1-Interval Connected Graphs