Rendezvous of Distance-Aware Mobile Agents in Unknown Graphs

DOI10.1007/978-3-319-09620-9_23zbMath1416.68190arXiv1406.2795OpenAlexW2915086378MaRDI QIDQ5496166

Przemysław Uznański, Adrian Kosowski, Shantanu Das, Dariusz Dereniowski

Publication date: 7 August 2014

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1406.2795

zbMATH Keywords

lower boundsrendezvousmobile agentsynchronousdistance oracleanonymous networks

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Artificial intelligence for robotics (68T40)

Related Items (7)

Byzantine gathering in networks ⋮ Byzantine gathering in polynomial time ⋮ Unnamed Item ⋮ Asynchronous approach in the plane: a deterministic polynomial algorithm ⋮ Deterministic Meeting of Sniffing Agents in the Plane ⋮ Deterministic rendezvous with different maps ⋮ Two-agent tree evacuation

This page was built for publication: Rendezvous of Distance-Aware Mobile Agents in Unknown Graphs