Anonymous Meeting in Networks
From MaRDI portal
Publication:5741761
DOI10.1137/1.9781611973105.53zbMath1421.68118OpenAlexW2949078204MaRDI QIDQ5741761
Publication date: 15 May 2019
Published in: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611973105.53
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Agent technology and artificial intelligence (68T42)
Related Items (5)
Price of asynchrony in mobile agents computing ⋮ Leader election for anonymous asynchronous agents in arbitrary networks ⋮ How to meet asynchronously at polynomial cost ⋮ Searching on a line: a complete characterization of the optimal solution ⋮ Deterministic polynomial approach in the plane
This page was built for publication: Anonymous Meeting in Networks
