On asynchronous rendezvous in general graphs
type: Item
instance of: scholarly article
title: On asynchronous rendezvous in general graphs
zbMATH Open document ID: 1407.68345
author: Evangelos Bampas
author: Lélia Blin
author: Jurek Czyzowicz
author: David Ilcinkas
author: Arnaud Labourel
author: Sébastien Tixeuil
author: Maria Potop-Butucaru
published in: Theoretical Computer Science
publication date: 2018-11-29T00:00:00Z
full work available at URL: revised TCS.pdf
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C57
Mathematics Subject Classification ID: 68T42
Mathematics Subject Classification ID: 68W15
zbMATH DE Number: 6986600
zbMATH Keywords: distributed algorithms
zbMATH Keywords: asynchronous
zbMATH Keywords: mobile agents
zbMATH Keywords: general graphs
zbMATH Keywords: rendezvous
MaRDI profile type: Publication
OpenAlex ID: W2884716215
cites work: Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
cites work: The theory of search games and rendezvous.
cites work: Synchronous gathering without multiplicity detection: a certified algorithm
cites work: Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids
cites work: Wait-Free Gathering Without Chirality
cites work: Distributed Computing by Mobile Robots: Gathering
cites work: Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
cites work: Tell Me Where I Am So I Can Meet You Sooner
cites work: Certified universal gathering in \(\mathbb {R}^2\) for oblivious mobile robots
cites work: How to meet asynchronously (almost) everywhere
cites work: Gathering of robots on anonymous grids and trees without multiplicity detection
cites work: How to Gather Asynchronous Oblivious Robots on Anonymous Rings
cites work: Asynchronous deterministic rendezvous in graphs
cites work: Fault-Tolerant and Self-stabilizing Mobile Robots Gathering
cites work: Anonymous meeting in networks
cites work: How to meet asynchronously at polynomial cost
cites work: Gathering of asynchronous robots with limited visibility
cites work: Gathering fat mobile robots with slim omnidirectional cameras
cites work: Gathering an Even Number of Robots in an Odd Ring without Global Multiplicity Detection
cites work: Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
cites work: Gathering asynchronous oblivious mobile robots in a ring
cites work: Impossibility of gathering by a set of autonomous mobile robots
cites work: Asynchronous Deterministic Rendezvous on the Line
Wikidata QID: Q129413548
DOI: 10.1016/J.TCS.2018.06.045
description: scientific article; zbMATH DE number 6986600