Fast Byzantine gathering with visibility in graphs

DOI10.1007/978-3-030-62401-9_10zbMath1475.68394arXiv2009.01544MaRDI QIDQ2037833

Avery Miller, Ullash Saha

Publication date: 8 July 2021

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

zbMATH Keywords

graphs; visibility; distributed algorithms; Byzantine faults; robot gathering

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

68T40: Artificial intelligence for robotics

68W15: Distributed algorithms