Tight bounds on distributed exploration of temporal graphs

DOI10.4230/LIPIcs.OPODIS.2019.22OpenAlexW3010704749MaRDI QIDQ5874255

Tsuyoshi Gotoh, Toshimitsu Masuzawa, Nicola Santoro, Paola Flocchini

Publication date: 7 February 2023

Full work available at URL: https://doi.org/10.4230/LIPIcs.OPODIS.2019.22

zbMATH Keywords

distributed algorithmmobile agentsarbitrary footprintexploration of dynamic networks

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)

Related Items (5)

Efficient live exploration of a dynamic ring with mobile robots ⋮ Exploration of \(k\)-edge-deficient temporal graphs ⋮ Exploration of \(k\)-edge-deficient temporal graphs ⋮ Exploration of dynamic cactuses with sub-logarithmic overhead ⋮ Almost uniform deployment of mobile agents in dynamic rings

This page was built for publication: Tight bounds on distributed exploration of temporal graphs