Asynchronous Gathering in a Dangerous Ring
Consider a set of <i>k</i> identical asynchronous mobile agents located in an anonymous ring of <i>n</i> nodes. The classical <span style="font-variant: small-caps;">Gather</span> (or <span style="font-variant: small-caps;">Rendezvous<...
Main Authors: | Stefan Dobrev, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2023-04-01
|
Series: | Algorithms |
Subjects: | |
Online Access: | https://www.mdpi.com/1999-4893/16/5/222 |
Similar Items
-
An Adaptive Data Gathering Algorithm for Minimum Travel Route Planning in WSNs Based on Rendezvous Points
by: Mukhtar Ghaleb, et al.
Published: (2019-10-01) -
Modeling vaccination and control strategies for outbreaks of monkeypox at gatherings
by: Pei Yuan, et al.
Published: (2022-11-01) -
HiCoDG: A Hierarchical Data-Gathering Scheme Using Cooperative Multiple Mobile Elements
by: Duc Van Le, et al.
Published: (2014-12-01) -
DGG: A Novel Framework for Crowd Gathering Detection
by: Jianqiang Xu, et al.
Published: (2021-12-01) -
Measuring Photon Rings with the ngEHT
by: Paul Tiede, et al.
Published: (2022-12-01)