Linear time and space gathering of anonymous mobile agents in asynchronous trees

DOI10.1016/j.tcs.2013.01.022zbMath1285.68006OpenAlexW2031618057MaRDI QIDQ1951563

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

Publication date: 6 June 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.01.022

zbMATH Keywords

time complexitytree networksmobile agentsspace complexitygathering problem

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Network design and communication in computer systems (68M10)

Related Items (4)

Price of asynchrony in mobile agents computing ⋮ Move-optimal partial gathering of mobile agents in asynchronous trees ⋮ Move-optimal partial gathering of mobile agents without identifiers or global knowledge in asynchronous unidirectional rings ⋮ Partial gathering of mobile agents in asynchronous unidirectional rings

This page was built for publication: Linear time and space gathering of anonymous mobile agents in asynchronous trees