Tight bounds on distributed exploration of temporal graphs

DOI10.4230/LIPICS.OPODIS.2019.22MaRDI QIDQ5874255zbMATH OpenOpenAlexFDO

Authors Tsuyoshi Gotoh, Toshimitsu Masuzawa, P. Flocchini, N. Santoro

Publication date 7 February 2023

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

zbMATH Keywords

arbitrary footprintdistributed algorithmexploration of dynamic networksmobile agents

Mathematics Subject Classification ID

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

Cited in

(6)

• Exploration of dynamic cactuses with sub-logarithmic overhead
• Almost uniform deployment of mobile agents in dynamic rings
• Symbolically Bounding the Drift in Time-Constrained MSC Graphs
• Exploration of \(k\)-edge-deficient temporal graphs
• Exploration of k-edge-deficient temporal graphs
• Efficient live exploration of a dynamic ring with mobile robots

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874255)