Exploration of dynamic cactuses with sub-logarithmic overhead
From MaRDI portal
Publication:2035475
DOI10.1007/s00224-020-10001-0OpenAlexW3049358372MaRDI QIDQ2035475
Publication date: 24 June 2021
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-020-10001-0
Cites Work
- Unnamed Item
- Traveling salesman problems in temporal graphs
- Exploration of the \(T\)-interval-connected dynamic graphs: the case of the ring
- A linear algorithm for the pos/neg-weighted 1-median problem on a cactus
- On exploring always-connected temporal graphs of small pathwidth
- Distributed exploration of dynamic rings
- Patrolling on dynamic ring networks
- Exploration of dynamic tori by multiple agents
- On temporal graph exploration
- Distributed computation in dynamic networks
- DMVP: Foremost Waypoint Coverage of Time-Varying Graphs
- Exploration of Constantly Connected Dynamic Graphs Based on Cactuses
- On the Complexity of Information Spreading in Dynamic Networks
- An Introduction to Temporal Graphs: An Algorithmic Perspective*
- Tight bounds on distributed exploration of temporal graphs
- Gathering in dynamic rings
This page was built for publication: Exploration of dynamic cactuses with sub-logarithmic overhead
