Move-optimal partial gathering of mobile agents in asynchronous trees

DOI10.1016/j.tcs.2017.09.016zbMath1380.68065OpenAlexW2758008029MaRDI QIDQ1680543

Fukuhito Ooshita, Masahiro Shibata, Toshimitsu Masuzawa, Hirotsugu Kakugawa

Publication date: 16 November 2017

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

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

zbMATH Keywords

distributed systemmobile agentgathering problempartial gathering problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14)

Related Items (1)

Move-optimal partial gathering of mobile agents without identifiers or global knowledge in asynchronous unidirectional rings

Cites Work

• Rendezvous and election of mobile agents: Impact of sense of direction
• Mobile search for a black hole in an anonymous ring
• Linear time and space gathering of anonymous mobile agents in asynchronous trees
• Asynchronous deterministic rendezvous in graphs
• Move-optimal gossiping among mobile agents
• Delays Induce an Exponential Memory Gap for Rendezvous in Trees
• Synchronous Rendezvous for Location-Aware Agents
• Mobile Agent Rendezvous in a Synchronous Torus
• Deterministic Rendezvous in Trees with Little Memory
• An O ( n log n ) Unidirectional Algorithm for the Circular Extrema Problem
• Structural Information and Communication Complexity
• Principles of Distributed Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Move-optimal partial gathering of mobile agents in asynchronous trees