Exploration of Constantly Connected Dynamic Graphs Based on Cactuses
From MaRDI portal
Publication:5496163
DOI10.1007/978-3-319-09620-9_20zbMath1416.68192OpenAlexW25440674MaRDI QIDQ5496163
Ahmed M. Wade, Ralf Klasing, David Ilcinkas
Publication date: 7 August 2014
Published in: Structural Information and Communication Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-09620-9_20
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Artificial intelligence for robotics (68T40)
Related Items (20)
Exploring a dynamic ring without landmark ⋮ On temporal graph exploration ⋮ Distributed exploration of dynamic rings ⋮ Non-strict Temporal Exploration ⋮ Efficient live exploration of a dynamic ring with mobile robots ⋮ Simple, strict, proper, happy: a study of reachability in temporal graphs ⋮ Cops \& robber on periodic temporal graphs: characterization and improved bounds ⋮ Invited paper: Simple, strict, proper, happy: a study of reachability in temporal graphs ⋮ Exploration of dynamic tori by multiple agents ⋮ Exploration of dynamic networks: tight bounds on the number of agents ⋮ Exploration of \(k\)-edge-deficient temporal graphs ⋮ Exploration of \(k\)-edge-deficient temporal graphs ⋮ Unnamed Item ⋮ Exploration of the \(T\)-interval-connected dynamic graphs: the case of the ring ⋮ Gathering in dynamic rings ⋮ Exploration of dynamic cactuses with sub-logarithmic overhead ⋮ Self-stabilizing robots in highly dynamic environments ⋮ Enabling Minimal Dominating Set in Highly Dynamic Distributed Systems ⋮ The temporal explorer who returns to the base ⋮ On the expressivity of time-varying graphs
This page was built for publication: Exploration of Constantly Connected Dynamic Graphs Based on Cactuses
