Space-Optimal Rendezvous of Mobile Agents in Asynchronous Trees

DOI10.1007/978-3-642-13284-1_8zbMath1284.68559OpenAlexW1571240480MaRDI QIDQ3569118

Hirotsugu Kakugawa, Daisuke Baba, Fukuhito Ooshita, Tomoko Izumi, Toshimitsu Masuzawa

Publication date: 17 June 2010

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

Full work available at URL: https://doi.org/10.1007/978-3-642-13284-1_8

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Artificial intelligence for robotics (68T40) Agent technology and artificial intelligence (68T42)

Related Items (3)

Constant Space Self-stabilizing Center Finding Algorithms in Chains and Trees ⋮ Time versus space trade-offs for rendezvous in trees ⋮ Deterministic Meeting of Sniffing Agents in the Plane

This page was built for publication: Space-Optimal Rendezvous of Mobile Agents in Asynchronous Trees