Deterministic Network Exploration by Anonymous Silent Agents with Local Traffic Reports

DOI10.1145/2594581zbMath1398.68053OpenAlexW2089187143MaRDI QIDQ4962168

Yoann Dieudonné, Andrzej Pelc

Publication date: 30 October 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2594581

zbMATH Keywords

networkgraphsdeterministic algorithmexplorationanonymous mobile agents

Mathematics Subject Classification ID

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

Related Items (5)

Exploring a dynamic ring without landmark ⋮ Distributed exploration of dynamic rings ⋮ Efficient live exploration of a dynamic ring with mobile robots ⋮ Exploration of dynamic networks: tight bounds on the number of agents ⋮ Time versus cost tradeoffs for deterministic rendezvous in networks

This page was built for publication: Deterministic Network Exploration by Anonymous Silent Agents with Local Traffic Reports