Exploring Graphs with Time Constraints by Unreliable Collections of Mobile Robots

DOI10.1007/978-3-319-73117-9_27zbMath1444.68015arXiv1710.00775OpenAlexW2762426729MaRDI QIDQ5127187

Maxime Godon, Jurek Czyzowicz, Arnaud Labourel, Euripides Markou, Evangelos Kranakis

Publication date: 21 October 2020

Published in: SOFSEM 2018: Theory and Practice of Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Artificial intelligence for robotics (68T40)

Related Items (1)

Two Robots Patrolling on a Line: Integer Version and Approximability

This page was built for publication: Exploring Graphs with Time Constraints by Unreliable Collections of Mobile Robots