How to meet asynchronously (almost) everywhere
Work
Year: 2012
Type: article
Abstract: Two mobile agents (robots) with distinct labels have to meet in an arbitrary, possibly infinite, unknown connected graph or in an unknown connected terrain in the plane. Agents are modeled as points, ... more
Source: ACM Transactions on Algorithms
Institutions Université du Québec en Outaouais, Laboratoire d’Informatique Fondamentale de Marseille
Cites: 37
Cited by: 137
Related to: 10
FWCI: 18.51
Citation percentile (by year/subfield): 98.43
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: green