Asymptotically Optimal Deterministic Rendezvous - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue International Journal of Foundations of Computer Science Année : 2011

Asymptotically Optimal Deterministic Rendezvous

Fabienne Carrier
  • Fonction : Auteur
Stéphane Devismes
Yvan Rivierre
  • Fonction : Auteur
  • PersonId : 764791
  • IdRef : 190793937

Résumé

In this paper, we address the deterministic rendezvous in graphs where k mobile agents, disseminated at different times and different nodes, have to meet in finite time at the same node. The mobile agents are autonomous, oblivious, labeled, and move asynchronously. Moreover, we consider an undirected anonymous connected graph. For this problem, we exhibit some asymptotical time and space lower bounds as well as some necessary conditions. We also propose an algorithm that is asymptotically optimal in both space and round complexities.
Fichier non déposé

Dates et versions

hal-01197399 , version 1 (11-09-2015)

Identifiants

Citer

Fabienne Carrier, Stéphane Devismes, Franck Petit, Yvan Rivierre. Asymptotically Optimal Deterministic Rendezvous. International Journal of Foundations of Computer Science, 2011, 22 (5), pp.1143-1159. ⟨10.1142/s012905411100860x⟩. ⟨hal-01197399⟩
140 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More