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<...

Full description

Bibliographic Details
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